TSTP Solution File: CSR100+7 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : CSR100+7 : TPTP v8.2.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:34 EDT 2024
% Result : Theorem 11.73s 3.55s
% Output : CNFRefutation 11.73s
% 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 : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 28 ( 7 sgn 16 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_from_ALL,conjecture,
? [X2341] : s__instance(X2341,s__Class31_1),
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(local_1,axiom,
s__instance(s__Class31_1,s__Class),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_1) ).
fof(c_0_3,negated_conjecture,
~ ? [X2341] : s__instance(X2341,s__Class31_1),
inference(assume_negation,[status(cth)],[prove_from_ALL]) ).
fof(c_0_4,negated_conjecture,
! [X2342] : ~ s__instance(X2342,s__Class31_1),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
fof(c_0_5,plain,
! [X2367,X2368,X2369,X2370,X2371,X2372,X2373,X2374,X2375] :
( ( s__instance(X2370,X2368)
| ~ s__instance(X2370,X2369)
| ~ s__instance(X2371,X2367)
| ~ s__instance(X2372,X2368)
| ~ s__instance(X2369,s__SetOrClass)
| ~ s__instance(X2368,s__SetOrClass)
| ~ s__instance(X2367,s__SetOrClass)
| X2368 != s__UnionFn(X2369,X2367) )
& ( s__instance(X2371,X2368)
| ~ s__instance(X2370,X2369)
| ~ s__instance(X2371,X2367)
| ~ s__instance(X2372,X2368)
| ~ s__instance(X2369,s__SetOrClass)
| ~ s__instance(X2368,s__SetOrClass)
| ~ s__instance(X2367,s__SetOrClass)
| X2368 != s__UnionFn(X2369,X2367) )
& ( s__instance(X2372,X2369)
| s__instance(X2372,X2367)
| ~ s__instance(X2370,X2369)
| ~ s__instance(X2371,X2367)
| ~ s__instance(X2372,X2368)
| ~ s__instance(X2369,s__SetOrClass)
| ~ s__instance(X2368,s__SetOrClass)
| ~ s__instance(X2367,s__SetOrClass)
| X2368 != s__UnionFn(X2369,X2367) )
& ( s__instance(X2375,s__SetOrClass)
| X2374 = s__UnionFn(X2375,X2373) )
& ( s__instance(X2374,s__SetOrClass)
| X2374 = s__UnionFn(X2375,X2373) )
& ( s__instance(X2373,s__SetOrClass)
| X2374 = s__UnionFn(X2375,X2373) )
& ( s__instance(esk1_3(X2373,X2374,X2375),X2375)
| X2374 = s__UnionFn(X2375,X2373) )
& ( s__instance(esk2_3(X2373,X2374,X2375),X2373)
| X2374 = s__UnionFn(X2375,X2373) )
& ( s__instance(esk3_3(X2373,X2374,X2375),X2374)
| X2374 = s__UnionFn(X2375,X2373) )
& ( ~ s__instance(esk3_3(X2373,X2374,X2375),X2375)
| ~ s__instance(esk1_3(X2373,X2374,X2375),X2374)
| ~ s__instance(esk2_3(X2373,X2374,X2375),X2374)
| X2374 = s__UnionFn(X2375,X2373) )
& ( ~ s__instance(esk3_3(X2373,X2374,X2375),X2373)
| ~ s__instance(esk1_3(X2373,X2374,X2375),X2374)
| ~ s__instance(esk2_3(X2373,X2374,X2375),X2374)
| X2374 = s__UnionFn(X2375,X2373) ) ),
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__Class31_1),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( s__instance(esk1_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__Class31_1,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__Class31_1,s__Class),
inference(split_conjunct,[status(thm)],[local_1]) ).
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.04/0.12 % Problem : CSR100+7 : TPTP v8.2.0. Bugfixed v7.3.0.
% 0.04/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n022.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 02:26:08 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 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
% 11.73/3.55 # Version: 3.1.0
% 11.73/3.55 # Preprocessing class: FMLLSMSLSSSNFFN.
% 11.73/3.55 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 11.73/3.55 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1495s (5) cores
% 11.73/3.55 # Starting new_bool_3 with 299s (1) cores
% 11.73/3.55 # Starting new_bool_1 with 299s (1) cores
% 11.73/3.55 # Starting sh5l with 299s (1) cores
% 11.73/3.55 # sh5l with pid 4782 completed with status 0
% 11.73/3.55 # Result found by sh5l
% 11.73/3.55 # Preprocessing class: FMLLSMSLSSSNFFN.
% 11.73/3.55 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 11.73/3.55 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1495s (5) cores
% 11.73/3.55 # Starting new_bool_3 with 299s (1) cores
% 11.73/3.55 # Starting new_bool_1 with 299s (1) cores
% 11.73/3.55 # Starting sh5l with 299s (1) cores
% 11.73/3.55 # SinE strategy is gf500_gu_R04_F100_L20000
% 11.73/3.55 # Search class: FGHSM-SMLM33-MFFFFFNN
% 11.73/3.55 # partial match(1): FGHSM-SMLM32-MFFFFFNN
% 11.73/3.55 # Scheduled 13 strats onto 1 cores with 299 seconds (299 total)
% 11.73/3.55 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 23s (1) cores
% 11.73/3.55 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with pid 4826 completed with status 0
% 11.73/3.55 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 11.73/3.55 # Preprocessing class: FMLLSMSLSSSNFFN.
% 11.73/3.55 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 11.73/3.55 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1495s (5) cores
% 11.73/3.55 # Starting new_bool_3 with 299s (1) cores
% 11.73/3.55 # Starting new_bool_1 with 299s (1) cores
% 11.73/3.55 # Starting sh5l with 299s (1) cores
% 11.73/3.55 # SinE strategy is gf500_gu_R04_F100_L20000
% 11.73/3.55 # Search class: FGHSM-SMLM33-MFFFFFNN
% 11.73/3.55 # partial match(1): FGHSM-SMLM32-MFFFFFNN
% 11.73/3.55 # Scheduled 13 strats onto 1 cores with 299 seconds (299 total)
% 11.73/3.55 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 23s (1) cores
% 11.73/3.55 # Preprocessing time : 0.052 s
% 11.73/3.55 # Presaturation interreduction done
% 11.73/3.55
% 11.73/3.55 # Proof found!
% 11.73/3.55 # SZS status Theorem
% 11.73/3.55 # SZS output start CNFRefutation
% See solution above
% 11.73/3.55 # Parsed axioms : 55597
% 11.73/3.55 # Removed by relevancy pruning/SinE : 54398
% 11.73/3.55 # Initial clauses : 1856
% 11.73/3.55 # Removed in clause preprocessing : 143
% 11.73/3.55 # Initial clauses in saturation : 1713
% 11.73/3.55 # Processed clauses : 5654
% 11.73/3.55 # ...of these trivial : 130
% 11.73/3.55 # ...subsumed : 15
% 11.73/3.55 # ...remaining for further processing : 5509
% 11.73/3.55 # Other redundant clauses eliminated : 287
% 11.73/3.55 # Clauses deleted for lack of memory : 0
% 11.73/3.55 # Backward-subsumed : 2086
% 11.73/3.55 # Backward-rewritten : 0
% 11.73/3.55 # Generated clauses : 18493
% 11.73/3.55 # ...of the previous two non-redundant : 17463
% 11.73/3.55 # ...aggressively subsumed : 0
% 11.73/3.55 # Contextual simplify-reflections : 189
% 11.73/3.55 # Paramodulations : 17848
% 11.73/3.55 # Factorizations : 0
% 11.73/3.55 # NegExts : 0
% 11.73/3.55 # Equation resolutions : 287
% 11.73/3.55 # Disequality decompositions : 0
% 11.73/3.55 # Total rewrite steps : 4314
% 11.73/3.55 # ...of those cached : 4055
% 11.73/3.55 # Propositional unsat checks : 1
% 11.73/3.55 # Propositional check models : 1
% 11.73/3.55 # Propositional check unsatisfiable : 0
% 11.73/3.55 # Propositional clauses : 0
% 11.73/3.55 # Propositional clauses after purity: 0
% 11.73/3.55 # Propositional unsat core size : 0
% 11.73/3.55 # Propositional preprocessing time : 0.000
% 11.73/3.55 # Propositional encoding time : 0.014
% 11.73/3.55 # Propositional solver time : 0.014
% 11.73/3.55 # Success case prop preproc time : 0.000
% 11.73/3.55 # Success case prop encoding time : 0.000
% 11.73/3.55 # Success case prop solver time : 0.000
% 11.73/3.55 # Current number of processed clauses : 1077
% 11.73/3.55 # Positive orientable unit clauses : 585
% 11.73/3.55 # Positive unorientable unit clauses: 1
% 11.73/3.55 # Negative unit clauses : 4
% 11.73/3.55 # Non-unit-clauses : 487
% 11.73/3.55 # Current number of unprocessed clauses: 15216
% 11.73/3.55 # ...number of literals in the above : 33320
% 11.73/3.55 # Current number of archived formulas : 0
% 11.73/3.55 # Current number of archived clauses : 4149
% 11.73/3.55 # Clause-clause subsumption calls (NU) : 1106765
% 11.73/3.55 # Rec. Clause-clause subsumption calls : 378200
% 11.73/3.55 # Non-unit clause-clause subsumptions : 202
% 11.73/3.55 # Unit Clause-clause subsumption calls : 43712
% 11.73/3.55 # Rewrite failures with RHS unbound : 1880
% 11.73/3.55 # BW rewrite match attempts : 11114
% 11.73/3.55 # BW rewrite match successes : 1820
% 11.73/3.55 # Condensation attempts : 0
% 11.73/3.55 # Condensation successes : 0
% 11.73/3.55 # Termbank termtop insertions : 1001434
% 11.73/3.55 # Search garbage collected termcells : 317708
% 11.73/3.55
% 11.73/3.55 # -------------------------------------------------
% 11.73/3.55 # User time : 1.441 s
% 11.73/3.55 # System time : 0.284 s
% 11.73/3.55 # Total time : 1.725 s
% 11.73/3.55 # Maximum resident set size: 132640 pages
% 11.73/3.55
% 11.73/3.55 # -------------------------------------------------
% 11.73/3.55 # User time : 2.624 s
% 11.73/3.55 # System time : 0.344 s
% 11.73/3.55 # Total time : 2.968 s
% 11.73/3.55 # Maximum resident set size: 57424 pages
% 11.73/3.55 % E---3.1 exiting
%------------------------------------------------------------------------------