TSTP Solution File: CSR092+3 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : CSR092+3 : TPTP v8.2.0. 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 : Mon May 20 19:18:24 EDT 2024
% Result : Theorem 8.67s 4.09s
% Output : CNFRefutation 8.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 36 ( 13 unt; 0 def)
% Number of atoms : 87 ( 5 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 93 ( 42 ~; 36 |; 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 : 39 ( 2 sgn 19 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_from_ALL,conjecture,
? [X2341] :
( s__ancestor(s__Man22_1,X2341)
& X2341 = s__Ancestor22_1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_from_ALL) ).
fof(kb_SUMO_26636,axiom,
! [X1,X15,X13] :
( ( s__instance(X15,s__SetOrClass)
& s__instance(X1,s__SetOrClass) )
=> ( ( s__subclass(X1,X15)
& s__instance(X13,X1) )
=> s__instance(X13,X15) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+2.ax',kb_SUMO_26636) ).
fof(kb_SUMO_26635,axiom,
! [X1,X15] :
( s__subclass(X1,X15)
=> ( s__instance(X1,s__SetOrClass)
& s__instance(X15,s__SetOrClass) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+2.ax',kb_SUMO_26635) ).
fof(kb_SUMO_26736,axiom,
! [X548,X550] :
( ( s__instance(X550,s__Organism)
& s__instance(X548,s__Organism) )
=> ( s__parent(X548,X550)
=> s__ancestor(X548,X550) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+2.ax',kb_SUMO_26736) ).
fof(kb_SUMO_26972,axiom,
! [X548,X550] :
( ( s__instance(X550,s__Organism)
& s__instance(X548,s__Organism) )
=> ( s__son(X548,X550)
=> s__parent(X548,X550) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+2.ax',kb_SUMO_26972) ).
fof(local_3,axiom,
s__son(s__Man22_1,s__Ancestor22_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_3) ).
fof(kb_SUMO_72666,axiom,
s__subclass(s__Man,s__Organism),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+5.ax',kb_SUMO_72666) ).
fof(local_1,axiom,
s__instance(s__Man22_1,s__Man),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_1) ).
fof(kb_SUMO_68891,axiom,
s__subclass(s__Human,s__Organism),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+5.ax',kb_SUMO_68891) ).
fof(local_2,axiom,
s__instance(s__Ancestor22_1,s__Human),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_2) ).
fof(c_0_10,negated_conjecture,
~ ? [X2341] :
( s__ancestor(s__Man22_1,X2341)
& X2341 = s__Ancestor22_1 ),
inference(assume_negation,[status(cth)],[prove_from_ALL]) ).
fof(c_0_11,plain,
! [X2459,X2460,X2461] :
( ~ s__instance(X2460,s__SetOrClass)
| ~ s__instance(X2459,s__SetOrClass)
| ~ s__subclass(X2459,X2460)
| ~ s__instance(X2461,X2459)
| s__instance(X2461,X2460) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26636])])]) ).
fof(c_0_12,plain,
! [X2457,X2458] :
( ( s__instance(X2457,s__SetOrClass)
| ~ s__subclass(X2457,X2458) )
& ( s__instance(X2458,s__SetOrClass)
| ~ s__subclass(X2457,X2458) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26635])])])]) ).
fof(c_0_13,negated_conjecture,
! [X2342] :
( ~ s__ancestor(s__Man22_1,X2342)
| X2342 != s__Ancestor22_1 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
fof(c_0_14,plain,
! [X2371,X2372] :
( ~ s__instance(X2372,s__Organism)
| ~ s__instance(X2371,s__Organism)
| ~ s__parent(X2371,X2372)
| s__ancestor(X2371,X2372) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26736])])]) ).
fof(c_0_15,plain,
! [X2434,X2435] :
( ~ s__instance(X2435,s__Organism)
| ~ s__instance(X2434,s__Organism)
| ~ s__son(X2434,X2435)
| s__parent(X2434,X2435) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26972])])]) ).
cnf(c_0_16,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_11]) ).
cnf(c_0_17,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,negated_conjecture,
( ~ s__ancestor(s__Man22_1,X1)
| X1 != s__Ancestor22_1 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,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_14]) ).
cnf(c_0_21,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_15]) ).
cnf(c_0_22,plain,
s__son(s__Man22_1,s__Ancestor22_1),
inference(split_conjunct,[status(thm)],[local_3]) ).
cnf(c_0_23,plain,
( s__instance(X1,X2)
| ~ s__instance(X1,X3)
| ~ s__subclass(X3,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_24,plain,
s__subclass(s__Man,s__Organism),
inference(split_conjunct,[status(thm)],[kb_SUMO_72666]) ).
cnf(c_0_25,negated_conjecture,
( X1 != s__Ancestor22_1
| ~ s__parent(s__Man22_1,X1)
| ~ s__instance(s__Man22_1,s__Organism)
| ~ s__instance(X1,s__Organism) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
( 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_21,c_0_22]) ).
cnf(c_0_27,plain,
( s__instance(X1,s__Organism)
| ~ s__instance(X1,s__Man) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
s__instance(s__Man22_1,s__Man),
inference(split_conjunct,[status(thm)],[local_1]) ).
cnf(c_0_29,plain,
s__subclass(s__Human,s__Organism),
inference(split_conjunct,[status(thm)],[kb_SUMO_68891]) ).
cnf(c_0_30,negated_conjecture,
( ~ s__instance(s__Man22_1,s__Organism)
| ~ s__instance(s__Ancestor22_1,s__Organism) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,plain,
s__instance(s__Man22_1,s__Organism),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
( s__instance(X1,s__Organism)
| ~ s__instance(X1,s__Human) ),
inference(spm,[status(thm)],[c_0_23,c_0_29]) ).
cnf(c_0_33,plain,
s__instance(s__Ancestor22_1,s__Human),
inference(split_conjunct,[status(thm)],[local_2]) ).
cnf(c_0_34,negated_conjecture,
~ s__instance(s__Ancestor22_1,s__Organism),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]) ).
cnf(c_0_35,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : CSR092+3 : TPTP v8.2.0. Bugfixed v7.3.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.16/0.36 % Computer : n007.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Sun May 19 00:45:38 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.22/0.50 Running first-order model finding
% 0.22/0.50 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 8.67/4.09 # Version: 3.1.0
% 8.67/4.09 # Preprocessing class: FLLLSMSLSSSNFFN.
% 8.67/4.09 # Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 8.67/4.09 # Starting G-E--_300_C01_S5PRR_S00 with 1490s (5) cores
% 8.67/4.09 # Starting new_bool_3 with 298s (1) cores
% 8.67/4.09 # Starting new_bool_1 with 298s (1) cores
% 8.67/4.09 # Starting sh5l with 298s (1) cores
% 8.67/4.09 # G-E--_300_C01_S5PRR_S00 with pid 16447 completed with status 0
% 8.67/4.09 # Result found by G-E--_300_C01_S5PRR_S00
% 8.67/4.09 # Preprocessing class: FLLLSMSLSSSNFFN.
% 8.67/4.09 # Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 8.67/4.09 # Starting G-E--_300_C01_S5PRR_S00 with 1490s (5) cores
% 8.67/4.09 # SinE strategy is gf200_h_gu_R03_F100_L20000
% 8.67/4.09 # Search class: FGHSS-SSLM33-MFFFFFNN
% 8.67/4.09 # partial match(1): FGHSM-SSLM33-MFFFFFNN
% 8.67/4.09 # Scheduled 6 strats onto 5 cores with 1490 seconds (1490 total)
% 8.67/4.09 # Starting G-E--_208_B07AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 805s (1) cores
% 8.67/4.09 # Starting G-E--_300_C01_S5PRR_S00 with 150s (1) cores
% 8.67/4.09 # Starting new_bool_3 with 135s (1) cores
% 8.67/4.09 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 135s (1) cores
% 8.67/4.09 # Starting G-E--_207_B07_F1_AE_CS_SP_PS_S0Y with 135s (1) cores
% 8.67/4.09 # G-E--_207_B07_F1_AE_CS_SP_PS_S0Y with pid 16457 completed with status 0
% 8.67/4.09 # Result found by G-E--_207_B07_F1_AE_CS_SP_PS_S0Y
% 8.67/4.09 # Preprocessing class: FLLLSMSLSSSNFFN.
% 8.67/4.09 # Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 8.67/4.09 # Starting G-E--_300_C01_S5PRR_S00 with 1490s (5) cores
% 8.67/4.09 # SinE strategy is gf200_h_gu_R03_F100_L20000
% 8.67/4.09 # Search class: FGHSS-SSLM33-MFFFFFNN
% 8.67/4.09 # partial match(1): FGHSM-SSLM33-MFFFFFNN
% 8.67/4.09 # Scheduled 6 strats onto 5 cores with 1490 seconds (1490 total)
% 8.67/4.09 # Starting G-E--_208_B07AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 805s (1) cores
% 8.67/4.09 # Starting G-E--_300_C01_S5PRR_S00 with 150s (1) cores
% 8.67/4.09 # Starting new_bool_3 with 135s (1) cores
% 8.67/4.09 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 135s (1) cores
% 8.67/4.09 # Starting G-E--_207_B07_F1_AE_CS_SP_PS_S0Y with 135s (1) cores
% 8.67/4.09 # Preprocessing time : 0.025 s
% 8.67/4.09 # Presaturation interreduction done
% 8.67/4.09
% 8.67/4.09 # Proof found!
% 8.67/4.09 # SZS status Theorem
% 8.67/4.09 # SZS output start CNFRefutation
% See solution above
% 8.67/4.09 # Parsed axioms : 145105
% 8.67/4.09 # Removed by relevancy pruning/SinE : 144383
% 8.67/4.09 # Initial clauses : 1048
% 8.67/4.09 # Removed in clause preprocessing : 46
% 8.67/4.09 # Initial clauses in saturation : 1002
% 8.67/4.09 # Processed clauses : 3577
% 8.67/4.09 # ...of these trivial : 332
% 8.67/4.09 # ...subsumed : 758
% 8.67/4.09 # ...remaining for further processing : 2487
% 8.67/4.09 # Other redundant clauses eliminated : 1
% 8.67/4.09 # Clauses deleted for lack of memory : 0
% 8.67/4.09 # Backward-subsumed : 37
% 8.67/4.09 # Backward-rewritten : 242
% 8.67/4.09 # Generated clauses : 11148
% 8.67/4.09 # ...of the previous two non-redundant : 9719
% 8.67/4.09 # ...aggressively subsumed : 0
% 8.67/4.09 # Contextual simplify-reflections : 34
% 8.67/4.09 # Paramodulations : 11137
% 8.67/4.09 # Factorizations : 6
% 8.67/4.09 # NegExts : 0
% 8.67/4.09 # Equation resolutions : 5
% 8.67/4.09 # Disequality decompositions : 0
% 8.67/4.09 # Total rewrite steps : 2524
% 8.67/4.09 # ...of those cached : 2131
% 8.67/4.09 # Propositional unsat checks : 0
% 8.67/4.09 # Propositional check models : 0
% 8.67/4.09 # Propositional check unsatisfiable : 0
% 8.67/4.09 # Propositional clauses : 0
% 8.67/4.09 # Propositional clauses after purity: 0
% 8.67/4.09 # Propositional unsat core size : 0
% 8.67/4.09 # Propositional preprocessing time : 0.000
% 8.67/4.09 # Propositional encoding time : 0.000
% 8.67/4.09 # Propositional solver time : 0.000
% 8.67/4.09 # Success case prop preproc time : 0.000
% 8.67/4.09 # Success case prop encoding time : 0.000
% 8.67/4.09 # Success case prop solver time : 0.000
% 8.67/4.09 # Current number of processed clauses : 1227
% 8.67/4.09 # Positive orientable unit clauses : 381
% 8.67/4.09 # Positive unorientable unit clauses: 0
% 8.67/4.09 # Negative unit clauses : 2
% 8.67/4.09 # Non-unit-clauses : 844
% 8.67/4.09 # Current number of unprocessed clauses: 5216
% 8.67/4.09 # ...number of literals in the above : 14840
% 8.67/4.09 # Current number of archived formulas : 0
% 8.67/4.09 # Current number of archived clauses : 1259
% 8.67/4.09 # Clause-clause subsumption calls (NU) : 264177
% 8.67/4.09 # Rec. Clause-clause subsumption calls : 84470
% 8.67/4.09 # Non-unit clause-clause subsumptions : 810
% 8.67/4.09 # Unit Clause-clause subsumption calls : 7341
% 8.67/4.09 # Rewrite failures with RHS unbound : 0
% 8.67/4.09 # BW rewrite match attempts : 288
% 8.67/4.09 # BW rewrite match successes : 88
% 8.67/4.09 # Condensation attempts : 0
% 8.67/4.09 # Condensation successes : 0
% 8.67/4.09 # Termbank termtop insertions : 1172338
% 8.67/4.09 # Search garbage collected termcells : 469907
% 8.67/4.09
% 8.67/4.09 # -------------------------------------------------
% 8.67/4.09 # User time : 0.747 s
% 8.67/4.09 # System time : 0.200 s
% 8.67/4.09 # Total time : 0.947 s
% 8.67/4.09 # Maximum resident set size: 172744 pages
% 8.67/4.09
% 8.67/4.09 # -------------------------------------------------
% 8.67/4.09 # User time : 4.537 s
% 8.67/4.09 # System time : 0.610 s
% 8.67/4.09 # Total time : 5.147 s
% 8.67/4.09 # Maximum resident set size: 98052 pages
% 8.67/4.09 % E---3.1 exiting
%------------------------------------------------------------------------------