TSTP Solution File: CSR109+7 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR109+7 : TPTP v8.2.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:14:44 EDT 2024
% Result : Theorem 3.70s 2.09s
% Output : CNFRefutation 3.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 12 unt; 0 def)
% Number of atoms : 85 ( 16 equ)
% Maximal formula atoms : 45 ( 4 avg)
% Number of connectives : 100 ( 36 ~; 42 |; 18 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 44 ( 16 sgn 20 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_from_SUMO_MILO,conjecture,
? [X2351] : s__instance(X2351,s__Reptile),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_from_SUMO_MILO) ).
fof(kb_SUMO_32603,axiom,
! [X137,X12,X136] :
( X12 = s__UnionFn(X136,X137)
<=> ! [X1138,X34,X1139] :
( ( s__instance(X136,s__SetOrClass)
& s__instance(X12,s__SetOrClass)
& s__instance(X137,s__SetOrClass) )
=> ( ( s__instance(X1138,X136)
& s__instance(X34,X137)
& s__instance(X1139,X12) )
=> ( s__instance(X1138,X12)
& s__instance(X34,X12)
& ( s__instance(X1139,X136)
| s__instance(X1139,X137) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+2.ax',kb_SUMO_32603) ).
fof(kb_SUMO_26635,axiom,
! [X1,X15] :
( s__subclass(X1,X15)
=> ( s__instance(X1,s__SetOrClass)
& s__instance(X15,s__SetOrClass) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+2.ax',kb_SUMO_26635) ).
fof(kb_SUMO_39530,axiom,
s__subclass(s__Snake,s__Reptile),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+2.ax',kb_SUMO_39530) ).
fof(c_0_4,negated_conjecture,
~ ? [X2351] : s__instance(X2351,s__Reptile),
inference(assume_negation,[status(cth)],[prove_from_SUMO_MILO]) ).
fof(c_0_5,negated_conjecture,
! [X2352] : ~ s__instance(X2352,s__Reptile),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_6,plain,
! [X2501,X2502,X2503,X2504,X2505,X2506,X2507,X2508,X2509] :
( ( s__instance(X2504,X2502)
| ~ s__instance(X2504,X2503)
| ~ s__instance(X2505,X2501)
| ~ s__instance(X2506,X2502)
| ~ s__instance(X2503,s__SetOrClass)
| ~ s__instance(X2502,s__SetOrClass)
| ~ s__instance(X2501,s__SetOrClass)
| X2502 != s__UnionFn(X2503,X2501) )
& ( s__instance(X2505,X2502)
| ~ s__instance(X2504,X2503)
| ~ s__instance(X2505,X2501)
| ~ s__instance(X2506,X2502)
| ~ s__instance(X2503,s__SetOrClass)
| ~ s__instance(X2502,s__SetOrClass)
| ~ s__instance(X2501,s__SetOrClass)
| X2502 != s__UnionFn(X2503,X2501) )
& ( s__instance(X2506,X2503)
| s__instance(X2506,X2501)
| ~ s__instance(X2504,X2503)
| ~ s__instance(X2505,X2501)
| ~ s__instance(X2506,X2502)
| ~ s__instance(X2503,s__SetOrClass)
| ~ s__instance(X2502,s__SetOrClass)
| ~ s__instance(X2501,s__SetOrClass)
| X2502 != s__UnionFn(X2503,X2501) )
& ( s__instance(X2509,s__SetOrClass)
| X2508 = s__UnionFn(X2509,X2507) )
& ( s__instance(X2508,s__SetOrClass)
| X2508 = s__UnionFn(X2509,X2507) )
& ( s__instance(X2507,s__SetOrClass)
| X2508 = s__UnionFn(X2509,X2507) )
& ( s__instance(esk6_3(X2507,X2508,X2509),X2509)
| X2508 = s__UnionFn(X2509,X2507) )
& ( s__instance(esk7_3(X2507,X2508,X2509),X2507)
| X2508 = s__UnionFn(X2509,X2507) )
& ( s__instance(esk8_3(X2507,X2508,X2509),X2508)
| X2508 = s__UnionFn(X2509,X2507) )
& ( ~ s__instance(esk8_3(X2507,X2508,X2509),X2509)
| ~ s__instance(esk6_3(X2507,X2508,X2509),X2508)
| ~ s__instance(esk7_3(X2507,X2508,X2509),X2508)
| X2508 = s__UnionFn(X2509,X2507) )
& ( ~ s__instance(esk8_3(X2507,X2508,X2509),X2507)
| ~ s__instance(esk6_3(X2507,X2508,X2509),X2508)
| ~ s__instance(esk7_3(X2507,X2508,X2509),X2508)
| X2508 = s__UnionFn(X2509,X2507) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_32603])])])])])])]) ).
cnf(c_0_7,negated_conjecture,
~ s__instance(X1,s__Reptile),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( s__instance(X1,s__SetOrClass)
| X2 = s__UnionFn(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,plain,
! [X2420,X2421] :
( ( s__instance(X2420,s__SetOrClass)
| ~ s__subclass(X2420,X2421) )
& ( s__instance(X2421,s__SetOrClass)
| ~ s__subclass(X2420,X2421) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26635])])])]) ).
cnf(c_0_10,plain,
( s__instance(esk6_3(X1,X2,X3),X3)
| X2 = s__UnionFn(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
( s__instance(X1,s__SetOrClass)
| ~ s__instance(X2,s__UnionFn(X3,X1)) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
s__subclass(s__Snake,s__Reptile),
inference(split_conjunct,[status(thm)],[kb_SUMO_39530]) ).
cnf(c_0_14,negated_conjecture,
X1 = s__UnionFn(s__Reptile,X2),
inference(spm,[status(thm)],[c_0_7,c_0_10]) ).
cnf(c_0_15,negated_conjecture,
( s__instance(X1,s__SetOrClass)
| ~ s__instance(X2,X3) ),
inference(spm,[status(thm)],[c_0_11,c_0_8]) ).
cnf(c_0_16,plain,
s__instance(s__Snake,s__SetOrClass),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
X1 = X2,
inference(spm,[status(thm)],[c_0_14,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
s__instance(X1,s__SetOrClass),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
~ s__instance(X1,X2),
inference(spm,[status(thm)],[c_0_7,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_18,c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : CSR109+7 : TPTP v8.2.0. Bugfixed v7.3.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n027.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:05:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.70/2.09 # Version: 3.1.0
% 3.70/2.09 # Preprocessing class: FMLLSMSLSSSNFFN.
% 3.70/2.09 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 3.70/2.09 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1495s (5) cores
% 3.70/2.09 # Starting new_bool_3 with 299s (1) cores
% 3.70/2.09 # Starting new_bool_1 with 299s (1) cores
% 3.70/2.09 # Starting sh5l with 299s (1) cores
% 3.70/2.09 # G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 20961 completed with status 0
% 3.70/2.09 # Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 3.70/2.09 # Preprocessing class: FMLLSMSLSSSNFFN.
% 3.70/2.09 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 3.70/2.09 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1495s (5) cores
% 3.70/2.09 # SinE strategy is gf200_h_gu_R03_F100_L20000
% 3.70/2.09 # Search class: FGHSS-FSLM32-MFFFFFNN
% 3.70/2.09 # Scheduled 6 strats onto 5 cores with 1495 seconds (1495 total)
% 3.70/2.09 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 808s (1) cores
% 3.70/2.09 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 150s (1) cores
% 3.70/2.09 # Starting new_bool_3 with 135s (1) cores
% 3.70/2.09 # Starting new_bool_1 with 135s (1) cores
% 3.70/2.09 # Starting sh5l with 135s (1) cores
% 3.70/2.09 # G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 20968 completed with status 0
% 3.70/2.09 # Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 3.70/2.09 # Preprocessing class: FMLLSMSLSSSNFFN.
% 3.70/2.09 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 3.70/2.09 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1495s (5) cores
% 3.70/2.09 # SinE strategy is gf200_h_gu_R03_F100_L20000
% 3.70/2.09 # Search class: FGHSS-FSLM32-MFFFFFNN
% 3.70/2.09 # Scheduled 6 strats onto 5 cores with 1495 seconds (1495 total)
% 3.70/2.09 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 808s (1) cores
% 3.70/2.09 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 150s (1) cores
% 3.70/2.09 # Preprocessing time : 0.016 s
% 3.70/2.09 # Presaturation interreduction done
% 3.70/2.09
% 3.70/2.09 # Proof found!
% 3.70/2.09 # SZS status Theorem
% 3.70/2.09 # SZS output start CNFRefutation
% See solution above
% 3.70/2.09 # Parsed axioms : 55589
% 3.70/2.09 # Removed by relevancy pruning/SinE : 55441
% 3.70/2.09 # Initial clauses : 243
% 3.70/2.09 # Removed in clause preprocessing : 21
% 3.70/2.09 # Initial clauses in saturation : 222
% 3.70/2.09 # Processed clauses : 444
% 3.70/2.09 # ...of these trivial : 25
% 3.70/2.09 # ...subsumed : 8
% 3.70/2.09 # ...remaining for further processing : 411
% 3.70/2.09 # Other redundant clauses eliminated : 0
% 3.70/2.09 # Clauses deleted for lack of memory : 0
% 3.70/2.09 # Backward-subsumed : 65
% 3.70/2.09 # Backward-rewritten : 45
% 3.70/2.09 # Generated clauses : 1327
% 3.70/2.09 # ...of the previous two non-redundant : 1054
% 3.70/2.09 # ...aggressively subsumed : 0
% 3.70/2.09 # Contextual simplify-reflections : 77
% 3.70/2.09 # Paramodulations : 1324
% 3.70/2.09 # Factorizations : 0
% 3.70/2.09 # NegExts : 0
% 3.70/2.09 # Equation resolutions : 0
% 3.70/2.09 # Disequality decompositions : 0
% 3.70/2.09 # Total rewrite steps : 348
% 3.70/2.09 # ...of those cached : 198
% 3.70/2.09 # Propositional unsat checks : 0
% 3.70/2.09 # Propositional check models : 0
% 3.70/2.09 # Propositional check unsatisfiable : 0
% 3.70/2.09 # Propositional clauses : 0
% 3.70/2.09 # Propositional clauses after purity: 0
% 3.70/2.09 # Propositional unsat core size : 0
% 3.70/2.09 # Propositional preprocessing time : 0.000
% 3.70/2.09 # Propositional encoding time : 0.000
% 3.70/2.09 # Propositional solver time : 0.000
% 3.70/2.09 # Success case prop preproc time : 0.000
% 3.70/2.09 # Success case prop encoding time : 0.000
% 3.70/2.09 # Success case prop solver time : 0.000
% 3.70/2.09 # Current number of processed clauses : 77
% 3.70/2.09 # Positive orientable unit clauses : 71
% 3.70/2.09 # Positive unorientable unit clauses: 1
% 3.70/2.09 # Negative unit clauses : 1
% 3.70/2.09 # Non-unit-clauses : 4
% 3.70/2.09 # Current number of unprocessed clauses: 871
% 3.70/2.09 # ...number of literals in the above : 1860
% 3.70/2.09 # Current number of archived formulas : 0
% 3.70/2.09 # Current number of archived clauses : 334
% 3.70/2.09 # Clause-clause subsumption calls (NU) : 9068
% 3.70/2.09 # Rec. Clause-clause subsumption calls : 1013
% 3.70/2.09 # Non-unit clause-clause subsumptions : 84
% 3.70/2.09 # Unit Clause-clause subsumption calls : 421
% 3.70/2.09 # Rewrite failures with RHS unbound : 382
% 3.70/2.09 # BW rewrite match attempts : 1000
% 3.70/2.09 # BW rewrite match successes : 414
% 3.70/2.09 # Condensation attempts : 0
% 3.70/2.09 # Condensation successes : 0
% 3.70/2.09 # Termbank termtop insertions : 678443
% 3.70/2.09 # Search garbage collected termcells : 294052
% 3.70/2.09
% 3.70/2.09 # -------------------------------------------------
% 3.70/2.09 # User time : 0.315 s
% 3.70/2.09 # System time : 0.120 s
% 3.70/2.09 # Total time : 0.435 s
% 3.70/2.09 # Maximum resident set size: 131884 pages
% 3.70/2.09
% 3.70/2.09 # -------------------------------------------------
% 3.70/2.09 # User time : 1.705 s
% 3.70/2.09 # System time : 0.227 s
% 3.70/2.09 # Total time : 1.932 s
% 3.70/2.09 # Maximum resident set size: 57424 pages
% 3.70/2.09 % E---3.1 exiting
% 3.70/2.09 % E exiting
%------------------------------------------------------------------------------