TSTP Solution File: CSR079+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : CSR079+1 : TPTP v8.1.2. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 07:35:55 EDT 2024
% Result : Theorem 16.01s 4.21s
% Output : CNFRefutation 16.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 16
% Syntax : Number of formulae : 53 ( 42 unt; 0 def)
% Number of atoms : 77 ( 26 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 44 ( 20 ~; 17 |; 4 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 15 con; 0-0 aty)
% Number of variables : 23 ( 2 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(local_24,axiom,
s__Class5_2 = s__Class5_3,
file('/export/starexec/sandbox2/tmp/tmp.w1VGfEWFyN/E---3.1_32648.p',local_24) ).
fof(local_23,axiom,
s__Class5_1 = s__Class5_2,
file('/export/starexec/sandbox2/tmp/tmp.w1VGfEWFyN/E---3.1_32648.p',local_23) ).
fof(local_25,axiom,
s__Class5_3 = s__Class5_4,
file('/export/starexec/sandbox2/tmp/tmp.w1VGfEWFyN/E---3.1_32648.p',local_25) ).
fof(local_26,axiom,
s__Class5_4 = s__Class5_5,
file('/export/starexec/sandbox2/tmp/tmp.w1VGfEWFyN/E---3.1_32648.p',local_26) ).
fof(local_27,axiom,
s__Class5_5 = s__Class5_6,
file('/export/starexec/sandbox2/tmp/tmp.w1VGfEWFyN/E---3.1_32648.p',local_27) ).
fof(local_28,axiom,
s__Class5_6 = s__Class5_7,
file('/export/starexec/sandbox2/tmp/tmp.w1VGfEWFyN/E---3.1_32648.p',local_28) ).
fof(local_29,axiom,
s__Class5_7 = s__Class5_8,
file('/export/starexec/sandbox2/tmp/tmp.w1VGfEWFyN/E---3.1_32648.p',local_29) ).
fof(local_30,axiom,
s__Class5_8 = s__Class5_9,
file('/export/starexec/sandbox2/tmp/tmp.w1VGfEWFyN/E---3.1_32648.p',local_30) ).
fof(kb_SUMO_27,axiom,
! [X6,X7,X8] :
( ( s__instance(X7,s__SetOrClass)
& s__instance(X6,s__SetOrClass) )
=> ( ( s__subclass(X6,X7)
& s__instance(X8,X6) )
=> s__instance(X8,X7) ) ),
file('/export/starexec/sandbox2/tmp/tmp.w1VGfEWFyN/E---3.1_32648.p',kb_SUMO_27) ).
fof(kb_SUMO_26,axiom,
! [X6,X7] :
( s__subclass(X6,X7)
=> ( s__instance(X6,s__SetOrClass)
& s__instance(X7,s__SetOrClass) ) ),
file('/export/starexec/sandbox2/tmp/tmp.w1VGfEWFyN/E---3.1_32648.p',kb_SUMO_26) ).
fof(local_31,axiom,
s__Class5_9 = s__Class5_10,
file('/export/starexec/sandbox2/tmp/tmp.w1VGfEWFyN/E---3.1_32648.p',local_31) ).
fof(local_33,axiom,
s__subclass(s__Class5_10,s__Reptile),
file('/export/starexec/sandbox2/tmp/tmp.w1VGfEWFyN/E---3.1_32648.p',local_33) ).
fof(local_32,axiom,
s__subclass(s__Lizard5_1,s__Class5_1),
file('/export/starexec/sandbox2/tmp/tmp.w1VGfEWFyN/E---3.1_32648.p',local_32) ).
fof(local_2,axiom,
s__instance(s__Organism5_1,s__Lizard5_1),
file('/export/starexec/sandbox2/tmp/tmp.w1VGfEWFyN/E---3.1_32648.p',local_2) ).
fof(prove_from_SUMO,conjecture,
s__instance(s__Organism5_1,s__Animal),
file('/export/starexec/sandbox2/tmp/tmp.w1VGfEWFyN/E---3.1_32648.p',prove_from_SUMO) ).
fof(kb_SUMOcache_7275,axiom,
s__subclass(s__Reptile,s__Animal),
file('/export/starexec/sandbox2/tmp/tmp.w1VGfEWFyN/E---3.1_32648.p',kb_SUMOcache_7275) ).
cnf(c_0_16,plain,
s__Class5_2 = s__Class5_3,
inference(split_conjunct,[status(thm)],[local_24]) ).
cnf(c_0_17,plain,
s__Class5_1 = s__Class5_2,
inference(split_conjunct,[status(thm)],[local_23]) ).
cnf(c_0_18,plain,
s__Class5_3 = s__Class5_4,
inference(split_conjunct,[status(thm)],[local_25]) ).
cnf(c_0_19,plain,
s__Class5_3 = s__Class5_1,
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
s__Class5_4 = s__Class5_5,
inference(split_conjunct,[status(thm)],[local_26]) ).
cnf(c_0_21,plain,
s__Class5_4 = s__Class5_1,
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
s__Class5_5 = s__Class5_6,
inference(split_conjunct,[status(thm)],[local_27]) ).
cnf(c_0_23,plain,
s__Class5_5 = s__Class5_1,
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
s__Class5_6 = s__Class5_7,
inference(split_conjunct,[status(thm)],[local_28]) ).
cnf(c_0_25,plain,
s__Class5_6 = s__Class5_1,
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
s__Class5_7 = s__Class5_8,
inference(split_conjunct,[status(thm)],[local_29]) ).
cnf(c_0_27,plain,
s__Class5_7 = s__Class5_1,
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,plain,
s__Class5_8 = s__Class5_9,
inference(split_conjunct,[status(thm)],[local_30]) ).
cnf(c_0_29,plain,
s__Class5_8 = s__Class5_1,
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
fof(c_0_30,plain,
! [X622,X623,X624] :
( ~ s__instance(X623,s__SetOrClass)
| ~ s__instance(X622,s__SetOrClass)
| ~ s__subclass(X622,X623)
| ~ s__instance(X624,X622)
| s__instance(X624,X623) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_27])])]) ).
fof(c_0_31,plain,
! [X620,X621] :
( ( s__instance(X620,s__SetOrClass)
| ~ s__subclass(X620,X621) )
& ( s__instance(X621,s__SetOrClass)
| ~ s__subclass(X620,X621) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26])])])]) ).
cnf(c_0_32,plain,
s__Class5_9 = s__Class5_10,
inference(split_conjunct,[status(thm)],[local_31]) ).
cnf(c_0_33,plain,
s__Class5_9 = s__Class5_1,
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,plain,
( s__instance(X3,X1)
| ~ s__instance(X1,s__SetOrClass)
| ~ s__instance(X2,s__SetOrClass)
| ~ s__subclass(X2,X1)
| ~ s__instance(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_35,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_36,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_37,plain,
s__subclass(s__Class5_10,s__Reptile),
inference(split_conjunct,[status(thm)],[local_33]) ).
cnf(c_0_38,plain,
s__Class5_10 = s__Class5_1,
inference(rw,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_39,plain,
( s__instance(X1,X2)
| ~ s__subclass(X3,X2)
| ~ s__instance(X1,X3) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_40,plain,
s__subclass(s__Lizard5_1,s__Class5_1),
inference(split_conjunct,[status(thm)],[local_32]) ).
cnf(c_0_41,plain,
s__subclass(s__Class5_1,s__Reptile),
inference(rw,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,plain,
( s__instance(X1,s__Class5_1)
| ~ s__instance(X1,s__Lizard5_1) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,plain,
s__instance(s__Organism5_1,s__Lizard5_1),
inference(split_conjunct,[status(thm)],[local_2]) ).
fof(c_0_44,negated_conjecture,
~ s__instance(s__Organism5_1,s__Animal),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[prove_from_SUMO])]) ).
cnf(c_0_45,plain,
s__subclass(s__Reptile,s__Animal),
inference(split_conjunct,[status(thm)],[kb_SUMOcache_7275]) ).
cnf(c_0_46,plain,
( s__instance(X1,s__Reptile)
| ~ s__instance(X1,s__Class5_1) ),
inference(spm,[status(thm)],[c_0_39,c_0_41]) ).
cnf(c_0_47,plain,
s__instance(s__Organism5_1,s__Class5_1),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
fof(c_0_48,negated_conjecture,
~ s__instance(s__Organism5_1,s__Animal),
inference(fof_nnf,[status(thm)],[c_0_44]) ).
cnf(c_0_49,plain,
( s__instance(X1,s__Animal)
| ~ s__instance(X1,s__Reptile) ),
inference(spm,[status(thm)],[c_0_39,c_0_45]) ).
cnf(c_0_50,plain,
s__instance(s__Organism5_1,s__Reptile),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_51,negated_conjecture,
~ s__instance(s__Organism5_1,s__Animal),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_52,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR079+1 : TPTP v8.1.2. Bugfixed v7.3.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n007.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri May 3 14:24:38 EDT 2024
% 0.13/0.34 % CPUTime :
% 1.83/2.03 Running first-order model finding
% 1.83/2.03 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.w1VGfEWFyN/E---3.1_32648.p
% 16.01/4.21 # Version: 3.1.0
% 16.01/4.21 # Preprocessing class: FMLLSMSLSSSNFFN.
% 16.01/4.21 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 16.01/4.21 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 16.01/4.21 # Starting new_bool_3 with 300s (1) cores
% 16.01/4.21 # Starting new_bool_1 with 300s (1) cores
% 16.01/4.21 # Starting sh5l with 300s (1) cores
% 16.01/4.21 # G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 32725 completed with status 0
% 16.01/4.21 # Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 16.01/4.21 # Preprocessing class: FMLLSMSLSSSNFFN.
% 16.01/4.21 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 16.01/4.21 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 16.01/4.21 # SinE strategy is gf200_h_gu_RUU_F100_L20000
% 16.01/4.21 # Search class: FGHSM-SMLM31-MFFFFFNN
% 16.01/4.21 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 16.01/4.21 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 811s (1) cores
% 16.01/4.21 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 16.01/4.21 # Starting new_bool_3 with 136s (1) cores
% 16.01/4.21 # Starting new_bool_1 with 136s (1) cores
% 16.01/4.21 # Starting sh5l with 136s (1) cores
% 16.01/4.21 # C07_19_nc_SAT001_MinMin_p005000_rr with pid 32732 completed with status 0
% 16.01/4.21 # Result found by C07_19_nc_SAT001_MinMin_p005000_rr
% 16.01/4.21 # Preprocessing class: FMLLSMSLSSSNFFN.
% 16.01/4.21 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 16.01/4.21 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 16.01/4.21 # SinE strategy is gf200_h_gu_RUU_F100_L20000
% 16.01/4.21 # Search class: FGHSM-SMLM31-MFFFFFNN
% 16.01/4.21 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 16.01/4.21 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 811s (1) cores
% 16.01/4.21 # Preprocessing time : 0.103 s
% 16.01/4.21 # Presaturation interreduction done
% 16.01/4.21
% 16.01/4.21 # Proof found!
% 16.01/4.21 # SZS status Theorem
% 16.01/4.21 # SZS output start CNFRefutation
% See solution above
% 16.01/4.21 # Parsed axioms : 14821
% 16.01/4.21 # Removed by relevancy pruning/SinE : 5253
% 16.01/4.21 # Initial clauses : 10386
% 16.01/4.21 # Removed in clause preprocessing : 60
% 16.01/4.21 # Initial clauses in saturation : 10326
% 16.01/4.21 # Processed clauses : 22476
% 16.01/4.21 # ...of these trivial : 2467
% 16.01/4.21 # ...subsumed : 245
% 16.01/4.21 # ...remaining for further processing : 19764
% 16.01/4.21 # Other redundant clauses eliminated : 97
% 16.01/4.21 # Clauses deleted for lack of memory : 0
% 16.01/4.21 # Backward-subsumed : 14
% 16.01/4.21 # Backward-rewritten : 918
% 16.01/4.21 # Generated clauses : 42384
% 16.01/4.21 # ...of the previous two non-redundant : 41567
% 16.01/4.21 # ...aggressively subsumed : 0
% 16.01/4.21 # Contextual simplify-reflections : 458
% 16.01/4.21 # Paramodulations : 42288
% 16.01/4.21 # Factorizations : 6
% 16.01/4.21 # NegExts : 0
% 16.01/4.21 # Equation resolutions : 99
% 16.01/4.21 # Disequality decompositions : 0
% 16.01/4.21 # Total rewrite steps : 5651
% 16.01/4.21 # ...of those cached : 3909
% 16.01/4.21 # Propositional unsat checks : 4
% 16.01/4.21 # Propositional check models : 4
% 16.01/4.21 # Propositional check unsatisfiable : 0
% 16.01/4.21 # Propositional clauses : 0
% 16.01/4.21 # Propositional clauses after purity: 0
% 16.01/4.21 # Propositional unsat core size : 0
% 16.01/4.21 # Propositional preprocessing time : 0.000
% 16.01/4.21 # Propositional encoding time : 0.047
% 16.01/4.21 # Propositional solver time : 0.056
% 16.01/4.21 # Success case prop preproc time : 0.000
% 16.01/4.21 # Success case prop encoding time : 0.000
% 16.01/4.21 # Success case prop solver time : 0.000
% 16.01/4.21 # Current number of processed clauses : 8962
% 16.01/4.21 # Positive orientable unit clauses : 6880
% 16.01/4.21 # Positive unorientable unit clauses: 16
% 16.01/4.21 # Negative unit clauses : 12
% 16.01/4.21 # Non-unit-clauses : 2054
% 16.01/4.21 # Current number of unprocessed clauses: 33966
% 16.01/4.21 # ...number of literals in the above : 75403
% 16.01/4.21 # Current number of archived formulas : 0
% 16.01/4.21 # Current number of archived clauses : 10744
% 16.01/4.21 # Clause-clause subsumption calls (NU) : 2712194
% 16.01/4.21 # Rec. Clause-clause subsumption calls : 648536
% 16.01/4.21 # Non-unit clause-clause subsumptions : 711
% 16.01/4.21 # Unit Clause-clause subsumption calls : 357575
% 16.01/4.21 # Rewrite failures with RHS unbound : 56
% 16.01/4.21 # BW rewrite match attempts : 4435
% 16.01/4.21 # BW rewrite match successes : 642
% 16.01/4.21 # Condensation attempts : 0
% 16.01/4.21 # Condensation successes : 0
% 16.01/4.21 # Termbank termtop insertions : 887460
% 16.01/4.21 # Search garbage collected termcells : 83469
% 16.01/4.21
% 16.01/4.21 # -------------------------------------------------
% 16.01/4.21 # User time : 1.911 s
% 16.01/4.21 # System time : 0.105 s
% 16.01/4.21 # Total time : 2.016 s
% 16.01/4.21 # Maximum resident set size: 35264 pages
% 16.01/4.21
% 16.01/4.21 # -------------------------------------------------
% 16.01/4.21 # User time : 8.086 s
% 16.01/4.21 # System time : 0.256 s
% 16.01/4.21 # Total time : 8.342 s
% 16.01/4.21 # Maximum resident set size: 12680 pages
% 16.01/4.21 % E---3.1 exiting
%------------------------------------------------------------------------------