TSTP Solution File: CSR084+7 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : CSR084+7 : TPTP v8.2.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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:17 EDT 2024
% Result : Theorem 4.16s 3.68s
% Output : CNFRefutation 4.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 11 unt; 0 def)
% Number of atoms : 69 ( 15 equ)
% Maximal formula atoms : 45 ( 4 avg)
% Number of connectives : 86 ( 31 ~; 36 |; 16 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 31 ( 8 sgn 18 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_from_ALL,conjecture,
? [X2348] : s__instance(X2348,s__Invertebrate),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_from_ALL) ).
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/sandbox/benchmark/Axioms/CSR003+2.ax',kb_SUMO_32603) ).
fof(kb_SUMO_27371,axiom,
! [X857] : s__instance(X857,s__Entity),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+2.ax',kb_SUMO_27371) ).
fof(c_0_3,negated_conjecture,
~ ? [X2348] : s__instance(X2348,s__Invertebrate),
inference(assume_negation,[status(cth)],[prove_from_ALL]) ).
fof(c_0_4,negated_conjecture,
! [X2349] : ~ s__instance(X2349,s__Invertebrate),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
fof(c_0_5,plain,
! [X2456,X2457,X2458,X2459,X2460,X2461,X2462,X2463,X2464] :
( ( s__instance(X2459,X2457)
| ~ s__instance(X2459,X2458)
| ~ s__instance(X2460,X2456)
| ~ s__instance(X2461,X2457)
| ~ s__instance(X2458,s__SetOrClass)
| ~ s__instance(X2457,s__SetOrClass)
| ~ s__instance(X2456,s__SetOrClass)
| X2457 != s__UnionFn(X2458,X2456) )
& ( s__instance(X2460,X2457)
| ~ s__instance(X2459,X2458)
| ~ s__instance(X2460,X2456)
| ~ s__instance(X2461,X2457)
| ~ s__instance(X2458,s__SetOrClass)
| ~ s__instance(X2457,s__SetOrClass)
| ~ s__instance(X2456,s__SetOrClass)
| X2457 != s__UnionFn(X2458,X2456) )
& ( s__instance(X2461,X2458)
| s__instance(X2461,X2456)
| ~ s__instance(X2459,X2458)
| ~ s__instance(X2460,X2456)
| ~ s__instance(X2461,X2457)
| ~ s__instance(X2458,s__SetOrClass)
| ~ s__instance(X2457,s__SetOrClass)
| ~ s__instance(X2456,s__SetOrClass)
| X2457 != s__UnionFn(X2458,X2456) )
& ( s__instance(X2464,s__SetOrClass)
| X2463 = s__UnionFn(X2464,X2462) )
& ( s__instance(X2463,s__SetOrClass)
| X2463 = s__UnionFn(X2464,X2462) )
& ( s__instance(X2462,s__SetOrClass)
| X2463 = s__UnionFn(X2464,X2462) )
& ( s__instance(esk9_3(X2462,X2463,X2464),X2464)
| X2463 = s__UnionFn(X2464,X2462) )
& ( s__instance(esk10_3(X2462,X2463,X2464),X2462)
| X2463 = s__UnionFn(X2464,X2462) )
& ( s__instance(esk11_3(X2462,X2463,X2464),X2463)
| X2463 = s__UnionFn(X2464,X2462) )
& ( ~ s__instance(esk11_3(X2462,X2463,X2464),X2464)
| ~ s__instance(esk9_3(X2462,X2463,X2464),X2463)
| ~ s__instance(esk10_3(X2462,X2463,X2464),X2463)
| X2463 = s__UnionFn(X2464,X2462) )
& ( ~ s__instance(esk11_3(X2462,X2463,X2464),X2462)
| ~ s__instance(esk9_3(X2462,X2463,X2464),X2463)
| ~ s__instance(esk10_3(X2462,X2463,X2464),X2463)
| X2463 = s__UnionFn(X2464,X2462) ) ),
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_6,negated_conjecture,
~ s__instance(X1,s__Invertebrate),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( s__instance(esk9_3(X1,X2,X3),X3)
| X2 = s__UnionFn(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
X1 = s__UnionFn(s__Invertebrate,X2),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
fof(c_0_9,plain,
! [X2473] : s__instance(X2473,s__Entity),
inference(variable_rename,[status(thm)],[kb_SUMO_27371]) ).
cnf(c_0_10,negated_conjecture,
X1 = X2,
inference(spm,[status(thm)],[c_0_8,c_0_8]) ).
cnf(c_0_11,plain,
s__instance(X1,s__Entity),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,negated_conjecture,
~ s__instance(X1,X2),
inference(spm,[status(thm)],[c_0_6,c_0_10]) ).
cnf(c_0_13,plain,
$false,
inference(sr,[status(thm)],[c_0_11,c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : CSR084+7 : TPTP v8.2.0. Bugfixed v7.3.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n009.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Sun May 19 02:19:37 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.19/0.46 Running first-order model finding
% 0.19/0.46 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
% 4.16/3.68 # Version: 3.1.0
% 4.16/3.68 # Preprocessing class: FMLLSMSLSSSNFFN.
% 4.16/3.68 # Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 4.16/3.68 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1490s (5) cores
% 4.16/3.68 # Starting new_bool_3 with 298s (1) cores
% 4.16/3.68 # Starting new_bool_1 with 298s (1) cores
% 4.16/3.68 # Starting sh5l with 298s (1) cores
% 4.16/3.68 # G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 10724 completed with status 0
% 4.16/3.68 # Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 4.16/3.68 # Preprocessing class: FMLLSMSLSSSNFFN.
% 4.16/3.68 # Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 4.16/3.68 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1490s (5) cores
% 4.16/3.68 # SinE strategy is gf200_h_gu_R03_F100_L20000
% 4.16/3.68 # Search class: FGHSS-FSLM31-MFFFFFNN
% 4.16/3.68 # partial match(1): FGHSM-FSLM31-MFFFFFNN
% 4.16/3.68 # Scheduled 7 strats onto 5 cores with 1490 seconds (1490 total)
% 4.16/3.68 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 671s (1) cores
% 4.16/3.68 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 150s (1) cores
% 4.16/3.68 # Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 135s (1) cores
% 4.16/3.68 # Starting U----_116Y_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 135s (1) cores
% 4.16/3.68 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 135s (1) cores
% 4.16/3.68 # G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 10731 completed with status 0
% 4.16/3.68 # Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 4.16/3.68 # Preprocessing class: FMLLSMSLSSSNFFN.
% 4.16/3.68 # Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 4.16/3.68 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1490s (5) cores
% 4.16/3.68 # SinE strategy is gf200_h_gu_R03_F100_L20000
% 4.16/3.68 # Search class: FGHSS-FSLM31-MFFFFFNN
% 4.16/3.68 # partial match(1): FGHSM-FSLM31-MFFFFFNN
% 4.16/3.68 # Scheduled 7 strats onto 5 cores with 1490 seconds (1490 total)
% 4.16/3.68 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 671s (1) cores
% 4.16/3.68 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 150s (1) cores
% 4.16/3.68 # Preprocessing time : 0.027 s
% 4.16/3.68 # Presaturation interreduction done
% 4.16/3.68
% 4.16/3.68 # Proof found!
% 4.16/3.68 # SZS status Theorem
% 4.16/3.68 # SZS output start CNFRefutation
% See solution above
% 4.16/3.68 # Parsed axioms : 55594
% 4.16/3.68 # Removed by relevancy pruning/SinE : 55406
% 4.16/3.68 # Initial clauses : 259
% 4.16/3.68 # Removed in clause preprocessing : 10
% 4.16/3.68 # Initial clauses in saturation : 249
% 4.16/3.68 # Processed clauses : 455
% 4.16/3.68 # ...of these trivial : 9
% 4.16/3.68 # ...subsumed : 1
% 4.16/3.68 # ...remaining for further processing : 445
% 4.16/3.68 # Other redundant clauses eliminated : 0
% 4.16/3.68 # Clauses deleted for lack of memory : 0
% 4.16/3.68 # Backward-subsumed : 73
% 4.16/3.68 # Backward-rewritten : 14
% 4.16/3.68 # Generated clauses : 1579
% 4.16/3.68 # ...of the previous two non-redundant : 1282
% 4.16/3.68 # ...aggressively subsumed : 0
% 4.16/3.68 # Contextual simplify-reflections : 22
% 4.16/3.68 # Paramodulations : 1572
% 4.16/3.68 # Factorizations : 0
% 4.16/3.68 # NegExts : 0
% 4.16/3.68 # Equation resolutions : 0
% 4.16/3.68 # Disequality decompositions : 0
% 4.16/3.68 # Total rewrite steps : 317
% 4.16/3.68 # ...of those cached : 191
% 4.16/3.68 # Propositional unsat checks : 0
% 4.16/3.68 # Propositional check models : 0
% 4.16/3.68 # Propositional check unsatisfiable : 0
% 4.16/3.68 # Propositional clauses : 0
% 4.16/3.68 # Propositional clauses after purity: 0
% 4.16/3.68 # Propositional unsat core size : 0
% 4.16/3.68 # Propositional preprocessing time : 0.000
% 4.16/3.68 # Propositional encoding time : 0.000
% 4.16/3.68 # Propositional solver time : 0.000
% 4.16/3.68 # Success case prop preproc time : 0.000
% 4.16/3.68 # Success case prop encoding time : 0.000
% 4.16/3.68 # Success case prop solver time : 0.000
% 4.16/3.68 # Current number of processed clauses : 105
% 4.16/3.68 # Positive orientable unit clauses : 102
% 4.16/3.68 # Positive unorientable unit clauses: 1
% 4.16/3.68 # Negative unit clauses : 1
% 4.16/3.68 # Non-unit-clauses : 1
% 4.16/3.68 # Current number of unprocessed clauses: 992
% 4.16/3.68 # ...number of literals in the above : 1824
% 4.16/3.68 # Current number of archived formulas : 0
% 4.16/3.68 # Current number of archived clauses : 340
% 4.16/3.68 # Clause-clause subsumption calls (NU) : 3764
% 4.16/3.68 # Rec. Clause-clause subsumption calls : 716
% 4.16/3.68 # Non-unit clause-clause subsumptions : 24
% 4.16/3.68 # Unit Clause-clause subsumption calls : 267
% 4.16/3.68 # Rewrite failures with RHS unbound : 396
% 4.16/3.68 # BW rewrite match attempts : 1102
% 4.16/3.68 # BW rewrite match successes : 403
% 4.16/3.68 # Condensation attempts : 0
% 4.16/3.68 # Condensation successes : 0
% 4.16/3.68 # Termbank termtop insertions : 674753
% 4.16/3.68 # Search garbage collected termcells : 292932
% 4.16/3.68
% 4.16/3.68 # -------------------------------------------------
% 4.16/3.68 # User time : 0.456 s
% 4.16/3.68 # System time : 0.157 s
% 4.16/3.68 # Total time : 0.614 s
% 4.16/3.68 # Maximum resident set size: 131892 pages
% 4.16/3.68
% 4.16/3.68 # -------------------------------------------------
% 4.16/3.68 # User time : 3.343 s
% 4.16/3.68 # System time : 0.526 s
% 4.16/3.68 # Total time : 3.870 s
% 4.16/3.68 # Maximum resident set size: 57400 pages
% 4.16/3.68 % E---3.1 exiting
%------------------------------------------------------------------------------