TSTP Solution File: CSR086+3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR086+3 : TPTP v8.1.2. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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 : Sat May 4 07:32:21 EDT 2024
% Result : Theorem 263.35s 261.07s
% Output : CNFRefutation 263.35s
% 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/tmp/tmp.1rEysyBaBj/E---3.1_10471.p',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/tmp/tmp.1rEysyBaBj/E---3.1_10471.p',kb_SUMO_26635) ).
fof(prove_from_ALL,conjecture,
? [X2341] : s__links(X2341,X2341,s__Arc13_1),
file('/export/starexec/sandbox/tmp/tmp.1rEysyBaBj/E---3.1_10471.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/tmp/tmp.1rEysyBaBj/E---3.1_10471.p',kb_SUMO_32710) ).
fof(kb_SUMO_32707,axiom,
s__subclass(s__GraphLoop,s__GraphArc),
file('/export/starexec/sandbox/tmp/tmp.1rEysyBaBj/E---3.1_10471.p',kb_SUMO_32707) ).
fof(local_1,axiom,
s__instance(s__Arc13_1,s__GraphLoop),
file('/export/starexec/sandbox/tmp/tmp.1rEysyBaBj/E---3.1_10471.p',local_1) ).
fof(c_0_6,plain,
! [X2440,X2441,X2442] :
( ~ s__instance(X2441,s__SetOrClass)
| ~ s__instance(X2440,s__SetOrClass)
| ~ s__subclass(X2440,X2441)
| ~ s__instance(X2442,X2440)
| s__instance(X2442,X2441) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26636])])]) ).
fof(c_0_7,plain,
! [X2438,X2439] :
( ( s__instance(X2438,s__SetOrClass)
| ~ s__subclass(X2438,X2439) )
& ( s__instance(X2439,s__SetOrClass)
| ~ s__subclass(X2438,X2439) ) ),
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,
! [X2391,X2393] :
( ( s__instance(esk13_1(X2391),s__GraphNode)
| ~ s__instance(X2391,s__GraphLoop)
| ~ s__instance(X2391,s__GraphArc) )
& ( s__links(esk13_1(X2391),esk13_1(X2391),X2391)
| ~ s__instance(X2391,s__GraphLoop)
| ~ s__instance(X2391,s__GraphArc) )
& ( ~ s__instance(X2393,s__GraphNode)
| ~ s__links(X2393,X2393,X2391)
| s__instance(X2391,s__GraphLoop)
| ~ s__instance(X2391,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(esk13_1(X1),esk13_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
% 99.53/99.65 % Problem : CSR086+3 : TPTP v8.1.2. Bugfixed v7.3.0.
% 99.57/99.67 % Command : run_E %s %d THM
% 99.60/99.88 % Computer : n026.cluster.edu
% 99.60/99.88 % Model : x86_64 x86_64
% 99.60/99.88 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 99.60/99.88 % Memory : 8042.1875MB
% 99.60/99.88 % OS : Linux 3.10.0-693.el7.x86_64
% 99.60/99.88 % CPULimit : 300
% 99.60/99.88 % WCLimit : 300
% 99.60/99.88 % DateTime : Fri May 3 15:16:17 EDT 2024
% 99.60/99.88 % CPUTime :
% 256.85/257.66 Running first-order theorem proving
% 256.85/257.66 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/tmp/tmp.1rEysyBaBj/E---3.1_10471.p
% 263.35/261.07 # Version: 3.1.0
% 263.35/261.07 # Preprocessing class: FLLLSMSLSSSNFFN.
% 263.35/261.07 # Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 263.35/261.07 # Starting G-E--_300_C01_S5PRR_S00 with 1490s (5) cores
% 263.35/261.07 # Starting new_bool_3 with 298s (1) cores
% 263.35/261.07 # Starting new_bool_1 with 298s (1) cores
% 263.35/261.07 # Starting sh5l with 298s (1) cores
% 263.35/261.07 # new_bool_3 with pid 14323 completed with status 0
% 263.35/261.07 # Result found by new_bool_3
% 263.35/261.07 # Preprocessing class: FLLLSMSLSSSNFFN.
% 263.35/261.07 # Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 263.35/261.07 # Starting G-E--_300_C01_S5PRR_S00 with 1490s (5) cores
% 263.35/261.07 # Starting new_bool_3 with 298s (1) cores
% 263.35/261.07 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 263.35/261.07 # Search class: FGHSS-FSLM32-MFFFFFNN
% 263.35/261.07 # Scheduled 5 strats onto 1 cores with 298 seconds (298 total)
% 263.35/261.07 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 179s (1) cores
% 263.35/261.07 # G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with pid 14327 completed with status 0
% 263.35/261.07 # Result found by G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 263.35/261.07 # Preprocessing class: FLLLSMSLSSSNFFN.
% 263.35/261.07 # Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 263.35/261.07 # Starting G-E--_300_C01_S5PRR_S00 with 1490s (5) cores
% 263.35/261.07 # Starting new_bool_3 with 298s (1) cores
% 263.35/261.07 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 263.35/261.07 # Search class: FGHSS-FSLM32-MFFFFFNN
% 263.35/261.07 # Scheduled 5 strats onto 1 cores with 298 seconds (298 total)
% 263.35/261.07 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 179s (1) cores
% 263.35/261.07 # Preprocessing time : 0.016 s
% 263.35/261.07 # Presaturation interreduction done
% 263.35/261.07
% 263.35/261.07 # Proof found!
% 263.35/261.07 # SZS status Theorem
% 263.35/261.07 # SZS output start CNFRefutation
% See solution above
% 263.35/261.07 # Parsed axioms : 145103
% 263.35/261.07 # Removed by relevancy pruning/SinE : 144774
% 263.35/261.07 # Initial clauses : 439
% 263.35/261.07 # Removed in clause preprocessing : 18
% 263.35/261.07 # Initial clauses in saturation : 421
% 263.35/261.07 # Processed clauses : 1613
% 263.35/261.07 # ...of these trivial : 210
% 263.35/261.07 # ...subsumed : 302
% 263.35/261.07 # ...remaining for further processing : 1101
% 263.35/261.07 # Other redundant clauses eliminated : 43
% 263.35/261.07 # Clauses deleted for lack of memory : 0
% 263.35/261.07 # Backward-subsumed : 28
% 263.35/261.07 # Backward-rewritten : 143
% 263.35/261.07 # Generated clauses : 13109
% 263.35/261.07 # ...of the previous two non-redundant : 12557
% 263.35/261.07 # ...aggressively subsumed : 0
% 263.35/261.07 # Contextual simplify-reflections : 18
% 263.35/261.07 # Paramodulations : 13066
% 263.35/261.07 # Factorizations : 0
% 263.35/261.07 # NegExts : 0
% 263.35/261.07 # Equation resolutions : 43
% 263.35/261.07 # Disequality decompositions : 0
% 263.35/261.07 # Total rewrite steps : 825
% 263.35/261.07 # ...of those cached : 650
% 263.35/261.07 # Propositional unsat checks : 0
% 263.35/261.07 # Propositional check models : 0
% 263.35/261.07 # Propositional check unsatisfiable : 0
% 263.35/261.07 # Propositional clauses : 0
% 263.35/261.07 # Propositional clauses after purity: 0
% 263.35/261.07 # Propositional unsat core size : 0
% 263.35/261.07 # Propositional preprocessing time : 0.000
% 263.35/261.07 # Propositional encoding time : 0.000
% 263.35/261.07 # Propositional solver time : 0.000
% 263.35/261.07 # Success case prop preproc time : 0.000
% 263.35/261.07 # Success case prop encoding time : 0.000
% 263.35/261.07 # Success case prop solver time : 0.000
% 263.35/261.07 # Current number of processed clauses : 480
% 263.35/261.07 # Positive orientable unit clauses : 200
% 263.35/261.07 # Positive unorientable unit clauses: 0
% 263.35/261.07 # Negative unit clauses : 2
% 263.35/261.07 # Non-unit-clauses : 278
% 263.35/261.07 # Current number of unprocessed clauses: 11698
% 263.35/261.07 # ...number of literals in the above : 31436
% 263.35/261.07 # Current number of archived formulas : 0
% 263.35/261.07 # Current number of archived clauses : 586
% 263.35/261.07 # Clause-clause subsumption calls (NU) : 40005
% 263.35/261.07 # Rec. Clause-clause subsumption calls : 10326
% 263.35/261.07 # Non-unit clause-clause subsumptions : 339
% 263.35/261.07 # Unit Clause-clause subsumption calls : 1825
% 263.35/261.07 # Rewrite failures with RHS unbound : 0
% 263.35/261.07 # BW rewrite match attempts : 357
% 263.35/261.07 # BW rewrite match successes : 102
% 263.35/261.07 # Condensation attempts : 0
% 263.35/261.07 # Condensation successes : 0
% 263.35/261.07 # Termbank termtop insertions : 1129674
% 263.35/261.07 # Search garbage collected termcells : 463040
% 263.35/261.07
% 263.35/261.07 # -------------------------------------------------
% 263.35/261.07 # User time : 0.565 s
% 263.35/261.07 # System time : 0.173 s
% 263.35/261.07 # Total time : 0.738 s
% 263.35/261.07 # Maximum resident set size: 174944 pages
% 263.35/261.07
% 263.35/261.07 # -------------------------------------------------
% 263.35/261.07 # User time : 3.006 s
% 263.35/261.07 # System time : 0.292 s
% 263.35/261.07 # Total time : 3.298 s
% 263.35/261.07 # Maximum resident set size: 100320 pages
% 263.35/261.07 % E---3.1 exiting
% 263.35/261.08 % E exiting
%------------------------------------------------------------------------------