TSTP Solution File: CSR092+2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : CSR092+2 : TPTP v8.2.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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 : Mon May 20 19:18:24 EDT 2024
% Result : Theorem 1.93s 1.39s
% Output : CNFRefutation 1.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 35 ( 13 unt; 0 def)
% Number of atoms : 83 ( 4 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 88 ( 40 ~; 33 |; 8 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 38 ( 2 sgn 19 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_from_SUMO_MILO,conjecture,
? [X1223] :
( s__ancestor(s__Man22_1,X1223)
& X1223 = s__Ancestor22_1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_from_SUMO_MILO) ).
fof(kb_SUMO_93,axiom,
! [X15,X16] :
( ( s__instance(X16,s__Organism)
& s__instance(X15,s__Organism) )
=> ( s__parent(X15,X16)
=> s__ancestor(X15,X16) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+1.ax',kb_SUMO_93) ).
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/benchmark/Axioms/CSR003+1.ax',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/benchmark/Axioms/CSR003+1.ax',kb_SUMO_26) ).
fof(kb_SUMO_226,axiom,
! [X15,X16] :
( ( s__instance(X16,s__Organism)
& s__instance(X15,s__Organism) )
=> ( s__son(X15,X16)
=> s__parent(X15,X16) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+1.ax',kb_SUMO_226) ).
fof(local_3,axiom,
s__son(s__Man22_1,s__Ancestor22_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_3) ).
fof(kb_SUMO_15957,axiom,
s__subclass(s__Human,s__Organism),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+4.ax',kb_SUMO_15957) ).
fof(local_2,axiom,
s__instance(s__Ancestor22_1,s__Human),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_2) ).
fof(kb_SUMO_18603,axiom,
s__subclass(s__Man,s__Organism),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+4.ax',kb_SUMO_18603) ).
fof(local_1,axiom,
s__instance(s__Man22_1,s__Man),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_1) ).
fof(c_0_10,negated_conjecture,
~ ? [X1223] :
( s__ancestor(s__Man22_1,X1223)
& X1223 = s__Ancestor22_1 ),
inference(assume_negation,[status(cth)],[prove_from_SUMO_MILO]) ).
fof(c_0_11,negated_conjecture,
! [X1224] :
( ~ s__ancestor(s__Man22_1,X1224)
| X1224 != s__Ancestor22_1 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
cnf(c_0_12,negated_conjecture,
( ~ s__ancestor(s__Man22_1,X1)
| X1 != s__Ancestor22_1 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_13,plain,
! [X1225,X1226] :
( ~ s__instance(X1226,s__Organism)
| ~ s__instance(X1225,s__Organism)
| ~ s__parent(X1225,X1226)
| s__ancestor(X1225,X1226) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_93])])]) ).
fof(c_0_14,plain,
! [X1368,X1369,X1370] :
( ~ s__instance(X1369,s__SetOrClass)
| ~ s__instance(X1368,s__SetOrClass)
| ~ s__subclass(X1368,X1369)
| ~ s__instance(X1370,X1368)
| s__instance(X1370,X1369) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_27])])]) ).
fof(c_0_15,plain,
! [X1366,X1367] :
( ( s__instance(X1366,s__SetOrClass)
| ~ s__subclass(X1366,X1367) )
& ( s__instance(X1367,s__SetOrClass)
| ~ s__subclass(X1366,X1367) ) ),
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_16,negated_conjecture,
~ s__ancestor(s__Man22_1,s__Ancestor22_1),
inference(er,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( s__ancestor(X2,X1)
| ~ s__instance(X1,s__Organism)
| ~ s__instance(X2,s__Organism)
| ~ s__parent(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,plain,
! [X1248,X1249] :
( ~ s__instance(X1249,s__Organism)
| ~ s__instance(X1248,s__Organism)
| ~ s__son(X1248,X1249)
| s__parent(X1248,X1249) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_226])])]) ).
cnf(c_0_19,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_14]) ).
cnf(c_0_20,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,negated_conjecture,
( ~ s__parent(s__Man22_1,s__Ancestor22_1)
| ~ s__instance(s__Man22_1,s__Organism)
| ~ s__instance(s__Ancestor22_1,s__Organism) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,plain,
( s__parent(X2,X1)
| ~ s__instance(X1,s__Organism)
| ~ s__instance(X2,s__Organism)
| ~ s__son(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
s__son(s__Man22_1,s__Ancestor22_1),
inference(split_conjunct,[status(thm)],[local_3]) ).
cnf(c_0_25,plain,
( s__instance(X1,X2)
| ~ s__subclass(X3,X2)
| ~ s__instance(X1,X3) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_26,plain,
s__subclass(s__Human,s__Organism),
inference(split_conjunct,[status(thm)],[kb_SUMO_15957]) ).
cnf(c_0_27,negated_conjecture,
( ~ s__instance(s__Man22_1,s__Organism)
| ~ s__instance(s__Ancestor22_1,s__Organism) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_28,plain,
( s__instance(X1,s__Organism)
| ~ s__instance(X1,s__Human) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,plain,
s__instance(s__Ancestor22_1,s__Human),
inference(split_conjunct,[status(thm)],[local_2]) ).
cnf(c_0_30,plain,
s__subclass(s__Man,s__Organism),
inference(split_conjunct,[status(thm)],[kb_SUMO_18603]) ).
cnf(c_0_31,negated_conjecture,
~ s__instance(s__Man22_1,s__Organism),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_32,plain,
( s__instance(X1,s__Organism)
| ~ s__instance(X1,s__Man) ),
inference(spm,[status(thm)],[c_0_25,c_0_30]) ).
cnf(c_0_33,plain,
s__instance(s__Man22_1,s__Man),
inference(split_conjunct,[status(thm)],[local_1]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CSR092+2 : TPTP v8.2.0. Bugfixed v7.3.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n016.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 : Sun May 19 01:04:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.21/0.47 Running first-order model finding
% 0.21/0.47 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/benchmark/theBenchmark.p
% 1.93/1.39 # Version: 3.1.0
% 1.93/1.39 # Preprocessing class: FMLLSMSLSSSNFFN.
% 1.93/1.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.93/1.39 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.93/1.39 # Starting new_bool_3 with 300s (1) cores
% 1.93/1.39 # Starting new_bool_1 with 300s (1) cores
% 1.93/1.39 # Starting sh5l with 300s (1) cores
% 1.93/1.39 # G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 7031 completed with status 0
% 1.93/1.39 # Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 1.93/1.39 # Preprocessing class: FMLLSMSLSSSNFFN.
% 1.93/1.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.93/1.39 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.93/1.39 # SinE strategy is gf200_h_gu_R03_F100_L20000
% 1.93/1.39 # Search class: FGHSS-FSLM31-MFFFFFNN
% 1.93/1.39 # partial match(1): FGHSM-FSLM31-MFFFFFNN
% 1.93/1.39 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.93/1.39 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 675s (1) cores
% 1.93/1.39 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 1.93/1.39 # Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 1.93/1.39 # Starting U----_116Y_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.93/1.39 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 136s (1) cores
% 1.93/1.39 # U----_116Y_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 7047 completed with status 0
% 1.93/1.39 # Result found by U----_116Y_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 1.93/1.39 # Preprocessing class: FMLLSMSLSSSNFFN.
% 1.93/1.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.93/1.39 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.93/1.39 # SinE strategy is gf200_h_gu_R03_F100_L20000
% 1.93/1.39 # Search class: FGHSS-FSLM31-MFFFFFNN
% 1.93/1.39 # partial match(1): FGHSM-FSLM31-MFFFFFNN
% 1.93/1.39 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.93/1.39 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 675s (1) cores
% 1.93/1.39 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 1.93/1.39 # Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 1.93/1.39 # Starting U----_116Y_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.93/1.39 # Preprocessing time : 0.013 s
% 1.93/1.39 # Presaturation interreduction done
% 1.93/1.39
% 1.93/1.39 # Proof found!
% 1.93/1.39 # SZS status Theorem
% 1.93/1.39 # SZS output start CNFRefutation
% See solution above
% 1.93/1.39 # Parsed axioms : 37985
% 1.93/1.39 # Removed by relevancy pruning/SinE : 37431
% 1.93/1.39 # Initial clauses : 615
% 1.93/1.39 # Removed in clause preprocessing : 4
% 1.93/1.39 # Initial clauses in saturation : 611
% 1.93/1.39 # Processed clauses : 1963
% 1.93/1.39 # ...of these trivial : 335
% 1.93/1.39 # ...subsumed : 8
% 1.93/1.39 # ...remaining for further processing : 1620
% 1.93/1.39 # Other redundant clauses eliminated : 4
% 1.93/1.39 # Clauses deleted for lack of memory : 0
% 1.93/1.39 # Backward-subsumed : 4
% 1.93/1.39 # Backward-rewritten : 14
% 1.93/1.39 # Generated clauses : 2096
% 1.93/1.39 # ...of the previous two non-redundant : 1804
% 1.93/1.39 # ...aggressively subsumed : 0
% 1.93/1.39 # Contextual simplify-reflections : 22
% 1.93/1.39 # Paramodulations : 2092
% 1.93/1.39 # Factorizations : 0
% 1.93/1.39 # NegExts : 0
% 1.93/1.39 # Equation resolutions : 4
% 1.93/1.39 # Disequality decompositions : 0
% 1.93/1.39 # Total rewrite steps : 670
% 1.93/1.39 # ...of those cached : 555
% 1.93/1.39 # Propositional unsat checks : 0
% 1.93/1.39 # Propositional check models : 0
% 1.93/1.39 # Propositional check unsatisfiable : 0
% 1.93/1.39 # Propositional clauses : 0
% 1.93/1.39 # Propositional clauses after purity: 0
% 1.93/1.39 # Propositional unsat core size : 0
% 1.93/1.39 # Propositional preprocessing time : 0.000
% 1.93/1.39 # Propositional encoding time : 0.000
% 1.93/1.39 # Propositional solver time : 0.000
% 1.93/1.39 # Success case prop preproc time : 0.000
% 1.93/1.39 # Success case prop encoding time : 0.000
% 1.93/1.39 # Success case prop solver time : 0.000
% 1.93/1.39 # Current number of processed clauses : 1012
% 1.93/1.39 # Positive orientable unit clauses : 443
% 1.93/1.39 # Positive unorientable unit clauses: 0
% 1.93/1.39 # Negative unit clauses : 2
% 1.93/1.39 # Non-unit-clauses : 567
% 1.93/1.39 # Current number of unprocessed clauses: 1038
% 1.93/1.39 # ...number of literals in the above : 5381
% 1.93/1.39 # Current number of archived formulas : 0
% 1.93/1.39 # Current number of archived clauses : 604
% 1.93/1.39 # Clause-clause subsumption calls (NU) : 38757
% 1.93/1.39 # Rec. Clause-clause subsumption calls : 14472
% 1.93/1.39 # Non-unit clause-clause subsumptions : 31
% 1.93/1.39 # Unit Clause-clause subsumption calls : 4787
% 1.93/1.39 # Rewrite failures with RHS unbound : 0
% 1.93/1.39 # BW rewrite match attempts : 15
% 1.93/1.39 # BW rewrite match successes : 14
% 1.93/1.39 # Condensation attempts : 0
% 1.93/1.39 # Condensation successes : 0
% 1.93/1.39 # Termbank termtop insertions : 311540
% 1.93/1.39 # Search garbage collected termcells : 128471
% 1.93/1.39
% 1.93/1.39 # -------------------------------------------------
% 1.93/1.39 # User time : 0.279 s
% 1.93/1.39 # System time : 0.078 s
% 1.93/1.39 # Total time : 0.357 s
% 1.93/1.39 # Maximum resident set size: 49516 pages
% 1.93/1.39
% 1.93/1.39 # -------------------------------------------------
% 1.93/1.39 # User time : 1.275 s
% 1.93/1.39 # System time : 0.271 s
% 1.93/1.39 # Total time : 1.546 s
% 1.93/1.39 # Maximum resident set size: 27836 pages
% 1.93/1.39 % E---3.1 exiting
%------------------------------------------------------------------------------