TSTP Solution File: CSR086+6 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR086+6 : TPTP v8.2.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:20 EDT 2024
% Result : Theorem 3.53s 2.07s
% Output : CNFRefutation 3.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 22 ( 10 unt; 0 def)
% Number of atoms : 58 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 64 ( 28 ~; 24 |; 7 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 30 ( 2 sgn 14 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
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(prove_from_ALL,conjecture,
? [X2341] : s__links(X2341,X2341,s__Arc13_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_from_ALL) ).
fof(kb_SUMO_32710,axiom,
! [X1148] :
( s__instance(X1148,s__GraphArc)
=> ( s__instance(X1148,s__GraphLoop)
<=> ? [X1149] :
( s__instance(X1149,s__GraphNode)
& s__links(X1149,X1149,X1148) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+2.ax',kb_SUMO_32710) ).
fof(kb_SUMO_32707,axiom,
s__subclass(s__GraphLoop,s__GraphArc),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+2.ax',kb_SUMO_32707) ).
fof(local_1,axiom,
s__instance(s__Arc13_1,s__GraphLoop),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_1) ).
fof(c_0_6,plain,
! [X2437,X2438,X2439] :
( ~ s__instance(X2438,s__SetOrClass)
| ~ s__instance(X2437,s__SetOrClass)
| ~ s__subclass(X2437,X2438)
| ~ s__instance(X2439,X2437)
| s__instance(X2439,X2438) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26636])])]) ).
fof(c_0_7,plain,
! [X2435,X2436] :
( ( s__instance(X2435,s__SetOrClass)
| ~ s__subclass(X2435,X2436) )
& ( s__instance(X2436,s__SetOrClass)
| ~ s__subclass(X2435,X2436) ) ),
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_8,negated_conjecture,
~ ? [X2341] : s__links(X2341,X2341,s__Arc13_1),
inference(assume_negation,[status(cth)],[prove_from_ALL]) ).
cnf(c_0_9,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_6]) ).
cnf(c_0_10,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_12,negated_conjecture,
! [X2342] : ~ s__links(X2342,X2342,s__Arc13_1),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_13,plain,
! [X2539,X2541] :
( ( s__instance(esk22_1(X2539),s__GraphNode)
| ~ s__instance(X2539,s__GraphLoop)
| ~ s__instance(X2539,s__GraphArc) )
& ( s__links(esk22_1(X2539),esk22_1(X2539),X2539)
| ~ s__instance(X2539,s__GraphLoop)
| ~ s__instance(X2539,s__GraphArc) )
& ( ~ s__instance(X2541,s__GraphNode)
| ~ s__links(X2541,X2541,X2539)
| s__instance(X2539,s__GraphLoop)
| ~ s__instance(X2539,s__GraphArc) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_32710])])])])])]) ).
cnf(c_0_14,plain,
( s__instance(X1,X2)
| ~ s__instance(X1,X3)
| ~ s__subclass(X3,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_15,plain,
s__subclass(s__GraphLoop,s__GraphArc),
inference(split_conjunct,[status(thm)],[kb_SUMO_32707]) ).
cnf(c_0_16,negated_conjecture,
~ s__links(X1,X1,s__Arc13_1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( s__links(esk22_1(X1),esk22_1(X1),X1)
| ~ s__instance(X1,s__GraphLoop)
| ~ s__instance(X1,s__GraphArc) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
s__instance(s__Arc13_1,s__GraphLoop),
inference(split_conjunct,[status(thm)],[local_1]) ).
cnf(c_0_19,plain,
( s__instance(X1,s__GraphArc)
| ~ s__instance(X1,s__GraphLoop) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
~ s__instance(s__Arc13_1,s__GraphArc),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_21,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_18]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CSR086+6 : TPTP v8.2.0. Bugfixed v7.3.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n029.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:37:07 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 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 --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.53/2.07 # Version: 3.1.0
% 3.53/2.07 # Preprocessing class: FMLLSMSLSSSNFFN.
% 3.53/2.07 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 3.53/2.07 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1495s (5) cores
% 3.53/2.07 # Starting new_bool_3 with 299s (1) cores
% 3.53/2.07 # Starting new_bool_1 with 299s (1) cores
% 3.53/2.07 # Starting sh5l with 299s (1) cores
% 3.53/2.07 # new_bool_1 with pid 6071 completed with status 0
% 3.53/2.07 # Result found by new_bool_1
% 3.53/2.07 # Preprocessing class: FMLLSMSLSSSNFFN.
% 3.53/2.07 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 3.53/2.07 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1495s (5) cores
% 3.53/2.07 # Starting new_bool_3 with 299s (1) cores
% 3.53/2.07 # Starting new_bool_1 with 299s (1) cores
% 3.53/2.07 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.53/2.07 # Search class: FGHSS-FSLM32-MFFFFFNN
% 3.53/2.07 # Scheduled 5 strats onto 1 cores with 299 seconds (299 total)
% 3.53/2.07 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 180s (1) cores
% 3.53/2.07 # G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with pid 6074 completed with status 0
% 3.53/2.07 # Result found by G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 3.53/2.07 # Preprocessing class: FMLLSMSLSSSNFFN.
% 3.53/2.07 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 3.53/2.07 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1495s (5) cores
% 3.53/2.07 # Starting new_bool_3 with 299s (1) cores
% 3.53/2.07 # Starting new_bool_1 with 299s (1) cores
% 3.53/2.07 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.53/2.07 # Search class: FGHSS-FSLM32-MFFFFFNN
% 3.53/2.07 # Scheduled 5 strats onto 1 cores with 299 seconds (299 total)
% 3.53/2.07 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 180s (1) cores
% 3.53/2.07 # Preprocessing time : 0.014 s
% 3.53/2.07 # Presaturation interreduction done
% 3.53/2.07
% 3.53/2.07 # Proof found!
% 3.53/2.07 # SZS status Theorem
% 3.53/2.07 # SZS output start CNFRefutation
% See solution above
% 3.53/2.07 # Parsed axioms : 55588
% 3.53/2.07 # Removed by relevancy pruning/SinE : 55466
% 3.53/2.07 # Initial clauses : 201
% 3.53/2.07 # Removed in clause preprocessing : 14
% 3.53/2.07 # Initial clauses in saturation : 187
% 3.53/2.07 # Processed clauses : 434
% 3.53/2.07 # ...of these trivial : 18
% 3.53/2.07 # ...subsumed : 20
% 3.53/2.07 # ...remaining for further processing : 396
% 3.53/2.07 # Other redundant clauses eliminated : 32
% 3.53/2.07 # Clauses deleted for lack of memory : 0
% 3.53/2.07 # Backward-subsumed : 7
% 3.53/2.07 # Backward-rewritten : 34
% 3.53/2.07 # Generated clauses : 888
% 3.53/2.07 # ...of the previous two non-redundant : 839
% 3.53/2.07 # ...aggressively subsumed : 0
% 3.53/2.07 # Contextual simplify-reflections : 15
% 3.53/2.07 # Paramodulations : 854
% 3.53/2.07 # Factorizations : 2
% 3.53/2.07 # NegExts : 0
% 3.53/2.07 # Equation resolutions : 32
% 3.53/2.07 # Disequality decompositions : 0
% 3.53/2.07 # Total rewrite steps : 97
% 3.53/2.07 # ...of those cached : 40
% 3.53/2.07 # Propositional unsat checks : 0
% 3.53/2.07 # Propositional check models : 0
% 3.53/2.07 # Propositional check unsatisfiable : 0
% 3.53/2.07 # Propositional clauses : 0
% 3.53/2.07 # Propositional clauses after purity: 0
% 3.53/2.07 # Propositional unsat core size : 0
% 3.53/2.07 # Propositional preprocessing time : 0.000
% 3.53/2.07 # Propositional encoding time : 0.000
% 3.53/2.07 # Propositional solver time : 0.000
% 3.53/2.07 # Success case prop preproc time : 0.000
% 3.53/2.07 # Success case prop encoding time : 0.000
% 3.53/2.07 # Success case prop solver time : 0.000
% 3.53/2.07 # Current number of processed clauses : 144
% 3.53/2.07 # Positive orientable unit clauses : 46
% 3.53/2.07 # Positive unorientable unit clauses: 0
% 3.53/2.07 # Negative unit clauses : 2
% 3.53/2.07 # Non-unit-clauses : 96
% 3.53/2.07 # Current number of unprocessed clauses: 263
% 3.53/2.07 # ...number of literals in the above : 924
% 3.53/2.07 # Current number of archived formulas : 0
% 3.53/2.07 # Current number of archived clauses : 228
% 3.53/2.07 # Clause-clause subsumption calls (NU) : 12580
% 3.53/2.07 # Rec. Clause-clause subsumption calls : 1373
% 3.53/2.07 # Non-unit clause-clause subsumptions : 40
% 3.53/2.07 # Unit Clause-clause subsumption calls : 162
% 3.53/2.07 # Rewrite failures with RHS unbound : 0
% 3.53/2.07 # BW rewrite match attempts : 55
% 3.53/2.07 # BW rewrite match successes : 31
% 3.53/2.07 # Condensation attempts : 0
% 3.53/2.07 # Condensation successes : 0
% 3.53/2.07 # Termbank termtop insertions : 672732
% 3.53/2.07 # Search garbage collected termcells : 293503
% 3.53/2.07
% 3.53/2.07 # -------------------------------------------------
% 3.53/2.07 # User time : 0.246 s
% 3.53/2.07 # System time : 0.121 s
% 3.53/2.07 # Total time : 0.366 s
% 3.53/2.07 # Maximum resident set size: 131724 pages
% 3.53/2.07
% 3.53/2.07 # -------------------------------------------------
% 3.53/2.07 # User time : 1.328 s
% 3.53/2.07 # System time : 0.176 s
% 3.53/2.07 # Total time : 1.504 s
% 3.53/2.07 # Maximum resident set size: 57424 pages
% 3.53/2.07 % E---3.1 exiting
% 3.53/2.07 % E exiting
%------------------------------------------------------------------------------