TSTP Solution File: CSR098+7 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : CSR098+7 : TPTP v8.2.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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:31 EDT 2024
% Result : Theorem 2.76s 2.07s
% Output : CNFRefutation 2.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 10 unt; 0 def)
% Number of atoms : 68 ( 15 equ)
% Maximal formula atoms : 45 ( 5 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 : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 28 ( 7 sgn 16 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_from_ALL,conjecture,
? [X2341] : s__instance(X2341,s__Amphibian),
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_51184,axiom,
s__instance(s__secretesToxin__m,s__BinaryPredicate),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+2.ax',kb_SUMO_51184) ).
fof(c_0_3,negated_conjecture,
~ ? [X2341] : s__instance(X2341,s__Amphibian),
inference(assume_negation,[status(cth)],[prove_from_ALL]) ).
fof(c_0_4,negated_conjecture,
! [X2342] : ~ s__instance(X2342,s__Amphibian),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
fof(c_0_5,plain,
! [X2530,X2531,X2532,X2533,X2534,X2535,X2536,X2537,X2538] :
( ( s__instance(X2533,X2531)
| ~ s__instance(X2533,X2532)
| ~ s__instance(X2534,X2530)
| ~ s__instance(X2535,X2531)
| ~ s__instance(X2532,s__SetOrClass)
| ~ s__instance(X2531,s__SetOrClass)
| ~ s__instance(X2530,s__SetOrClass)
| X2531 != s__UnionFn(X2532,X2530) )
& ( s__instance(X2534,X2531)
| ~ s__instance(X2533,X2532)
| ~ s__instance(X2534,X2530)
| ~ s__instance(X2535,X2531)
| ~ s__instance(X2532,s__SetOrClass)
| ~ s__instance(X2531,s__SetOrClass)
| ~ s__instance(X2530,s__SetOrClass)
| X2531 != s__UnionFn(X2532,X2530) )
& ( s__instance(X2535,X2532)
| s__instance(X2535,X2530)
| ~ s__instance(X2533,X2532)
| ~ s__instance(X2534,X2530)
| ~ s__instance(X2535,X2531)
| ~ s__instance(X2532,s__SetOrClass)
| ~ s__instance(X2531,s__SetOrClass)
| ~ s__instance(X2530,s__SetOrClass)
| X2531 != s__UnionFn(X2532,X2530) )
& ( s__instance(X2538,s__SetOrClass)
| X2537 = s__UnionFn(X2538,X2536) )
& ( s__instance(X2537,s__SetOrClass)
| X2537 = s__UnionFn(X2538,X2536) )
& ( s__instance(X2536,s__SetOrClass)
| X2537 = s__UnionFn(X2538,X2536) )
& ( s__instance(esk11_3(X2536,X2537,X2538),X2538)
| X2537 = s__UnionFn(X2538,X2536) )
& ( s__instance(esk12_3(X2536,X2537,X2538),X2536)
| X2537 = s__UnionFn(X2538,X2536) )
& ( s__instance(esk13_3(X2536,X2537,X2538),X2537)
| X2537 = s__UnionFn(X2538,X2536) )
& ( ~ s__instance(esk13_3(X2536,X2537,X2538),X2538)
| ~ s__instance(esk11_3(X2536,X2537,X2538),X2537)
| ~ s__instance(esk12_3(X2536,X2537,X2538),X2537)
| X2537 = s__UnionFn(X2538,X2536) )
& ( ~ s__instance(esk13_3(X2536,X2537,X2538),X2536)
| ~ s__instance(esk11_3(X2536,X2537,X2538),X2537)
| ~ s__instance(esk12_3(X2536,X2537,X2538),X2537)
| X2537 = s__UnionFn(X2538,X2536) ) ),
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__Amphibian),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( s__instance(esk11_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__Amphibian,X2),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,negated_conjecture,
X1 = X2,
inference(spm,[status(thm)],[c_0_8,c_0_8]) ).
cnf(c_0_10,plain,
s__instance(s__secretesToxin__m,s__BinaryPredicate),
inference(split_conjunct,[status(thm)],[kb_SUMO_51184]) ).
cnf(c_0_11,negated_conjecture,
~ s__instance(X1,X2),
inference(spm,[status(thm)],[c_0_6,c_0_9]) ).
cnf(c_0_12,plain,
$false,
inference(sr,[status(thm)],[c_0_10,c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : CSR098+7 : TPTP v8.2.0. Bugfixed v7.3.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n012.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sun May 19 02:25:23 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 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
% 2.76/2.07 # Version: 3.1.0
% 2.76/2.07 # Preprocessing class: FMLLSMSLSSSNFFN.
% 2.76/2.07 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 2.76/2.07 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1495s (5) cores
% 2.76/2.07 # Starting new_bool_3 with 299s (1) cores
% 2.76/2.07 # Starting new_bool_1 with 299s (1) cores
% 2.76/2.07 # Starting sh5l with 299s (1) cores
% 2.76/2.07 # new_bool_3 with pid 28605 completed with status 0
% 2.76/2.07 # Result found by new_bool_3
% 2.76/2.07 # Preprocessing class: FMLLSMSLSSSNFFN.
% 2.76/2.07 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 2.76/2.07 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1495s (5) cores
% 2.76/2.07 # Starting new_bool_3 with 299s (1) cores
% 2.76/2.07 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.76/2.07 # Search class: FGHSS-FSLM32-MFFFFFNN
% 2.76/2.07 # Scheduled 5 strats onto 1 cores with 299 seconds (299 total)
% 2.76/2.07 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 180s (1) cores
% 2.76/2.07 # G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with pid 28680 completed with status 0
% 2.76/2.07 # Result found by G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 2.76/2.07 # Preprocessing class: FMLLSMSLSSSNFFN.
% 2.76/2.07 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 2.76/2.07 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1495s (5) cores
% 2.76/2.07 # Starting new_bool_3 with 299s (1) cores
% 2.76/2.07 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.76/2.07 # Search class: FGHSS-FSLM32-MFFFFFNN
% 2.76/2.07 # Scheduled 5 strats onto 1 cores with 299 seconds (299 total)
% 2.76/2.07 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 180s (1) cores
% 2.76/2.07 # Preprocessing time : 0.023 s
% 2.76/2.07 # Presaturation interreduction done
% 2.76/2.07
% 2.76/2.07 # Proof found!
% 2.76/2.07 # SZS status Theorem
% 2.76/2.07 # SZS output start CNFRefutation
% See solution above
% 2.76/2.07 # Parsed axioms : 55590
% 2.76/2.07 # Removed by relevancy pruning/SinE : 55452
% 2.76/2.07 # Initial clauses : 215
% 2.76/2.07 # Removed in clause preprocessing : 19
% 2.76/2.07 # Initial clauses in saturation : 196
% 2.76/2.07 # Processed clauses : 422
% 2.76/2.07 # ...of these trivial : 14
% 2.76/2.07 # ...subsumed : 8
% 2.76/2.07 # ...remaining for further processing : 400
% 2.76/2.07 # Other redundant clauses eliminated : 22
% 2.76/2.07 # Clauses deleted for lack of memory : 0
% 2.76/2.07 # Backward-subsumed : 79
% 2.76/2.07 # Backward-rewritten : 41
% 2.76/2.07 # Generated clauses : 1137
% 2.76/2.07 # ...of the previous two non-redundant : 890
% 2.76/2.07 # ...aggressively subsumed : 0
% 2.76/2.07 # Contextual simplify-reflections : 83
% 2.76/2.07 # Paramodulations : 1109
% 2.76/2.07 # Factorizations : 0
% 2.76/2.07 # NegExts : 0
% 2.76/2.07 # Equation resolutions : 22
% 2.76/2.07 # Disequality decompositions : 0
% 2.76/2.07 # Total rewrite steps : 308
% 2.76/2.07 # ...of those cached : 181
% 2.76/2.07 # Propositional unsat checks : 0
% 2.76/2.07 # Propositional check models : 0
% 2.76/2.07 # Propositional check unsatisfiable : 0
% 2.76/2.07 # Propositional clauses : 0
% 2.76/2.07 # Propositional clauses after purity: 0
% 2.76/2.07 # Propositional unsat core size : 0
% 2.76/2.07 # Propositional preprocessing time : 0.000
% 2.76/2.07 # Propositional encoding time : 0.000
% 2.76/2.07 # Propositional solver time : 0.000
% 2.76/2.07 # Success case prop preproc time : 0.000
% 2.76/2.07 # Success case prop encoding time : 0.000
% 2.76/2.07 # Success case prop solver time : 0.000
% 2.76/2.07 # Current number of processed clauses : 57
% 2.76/2.07 # Positive orientable unit clauses : 51
% 2.76/2.07 # Positive unorientable unit clauses: 1
% 2.76/2.07 # Negative unit clauses : 1
% 2.76/2.07 # Non-unit-clauses : 4
% 2.76/2.07 # Current number of unprocessed clauses: 771
% 2.76/2.07 # ...number of literals in the above : 1707
% 2.76/2.07 # Current number of archived formulas : 0
% 2.76/2.07 # Current number of archived clauses : 321
% 2.76/2.07 # Clause-clause subsumption calls (NU) : 10328
% 2.76/2.07 # Rec. Clause-clause subsumption calls : 946
% 2.76/2.07 # Non-unit clause-clause subsumptions : 90
% 2.76/2.07 # Unit Clause-clause subsumption calls : 314
% 2.76/2.07 # Rewrite failures with RHS unbound : 344
% 2.76/2.07 # BW rewrite match attempts : 954
% 2.76/2.07 # BW rewrite match successes : 368
% 2.76/2.07 # Condensation attempts : 0
% 2.76/2.07 # Condensation successes : 0
% 2.76/2.07 # Termbank termtop insertions : 676066
% 2.76/2.07 # Search garbage collected termcells : 293677
% 2.76/2.07
% 2.76/2.07 # -------------------------------------------------
% 2.76/2.07 # User time : 0.295 s
% 2.76/2.07 # System time : 0.134 s
% 2.76/2.07 # Total time : 0.429 s
% 2.76/2.07 # Maximum resident set size: 131740 pages
% 2.76/2.07
% 2.76/2.07 # -------------------------------------------------
% 2.76/2.07 # User time : 1.340 s
% 2.76/2.07 # System time : 0.184 s
% 2.76/2.07 # Total time : 1.525 s
% 2.76/2.07 # Maximum resident set size: 57428 pages
% 2.76/2.07 % E---3.1 exiting
%------------------------------------------------------------------------------