TSTP Solution File: CSR086+5 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : CSR086+5 : TPTP v8.1.2. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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:36:02 EDT 2024
% Result : Theorem 3.57s 3.89s
% Output : CNFRefutation 3.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% 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 : 63 ( 27 ~; 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_27,axiom,
! [X6,X7,X8] :
( ( s__instance(X7,s__SetOrClass)
& s__instance(X6,s__SetOrClass) )
=> ( ( s__subclass(X6,X7)
& s__instance(X8,X6) )
=> s__instance(X8,X7) ) ),
file('/export/starexec/sandbox/tmp/tmp.chZHPGxliX/E---3.1_5113.p',kb_SUMO_27) ).
fof(kb_SUMO_26,axiom,
! [X6,X7] :
( s__subclass(X6,X7)
=> ( s__instance(X6,s__SetOrClass)
& s__instance(X7,s__SetOrClass) ) ),
file('/export/starexec/sandbox/tmp/tmp.chZHPGxliX/E---3.1_5113.p',kb_SUMO_26) ).
fof(kb_SUMO_4786,axiom,
s__subclass(s__GraphLoop,s__GraphArc),
file('/export/starexec/sandbox/tmp/tmp.chZHPGxliX/E---3.1_5113.p',kb_SUMO_4786) ).
fof(prove_from_SUMO_MILO,conjecture,
? [X1223] : s__links(X1223,X1223,s__Arc13_1),
file('/export/starexec/sandbox/tmp/tmp.chZHPGxliX/E---3.1_5113.p',prove_from_SUMO_MILO) ).
fof(kb_SUMO_4789,axiom,
! [X185] :
( s__instance(X185,s__GraphArc)
=> ( s__instance(X185,s__GraphLoop)
<=> ? [X186] :
( s__instance(X186,s__GraphNode)
& s__links(X186,X186,X185) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.chZHPGxliX/E---3.1_5113.p',kb_SUMO_4789) ).
fof(local_1,axiom,
s__instance(s__Arc13_1,s__GraphLoop),
file('/export/starexec/sandbox/tmp/tmp.chZHPGxliX/E---3.1_5113.p',local_1) ).
fof(c_0_6,plain,
! [X1315,X1316,X1317] :
( ~ s__instance(X1316,s__SetOrClass)
| ~ s__instance(X1315,s__SetOrClass)
| ~ s__subclass(X1315,X1316)
| ~ s__instance(X1317,X1315)
| s__instance(X1317,X1316) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_27])])]) ).
fof(c_0_7,plain,
! [X1313,X1314] :
( ( s__instance(X1313,s__SetOrClass)
| ~ s__subclass(X1313,X1314) )
& ( s__instance(X1314,s__SetOrClass)
| ~ s__subclass(X1313,X1314) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26])])])]) ).
cnf(c_0_8,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_9,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( s__instance(X1,X2)
| ~ s__subclass(X3,X2)
| ~ s__instance(X1,X3) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
cnf(c_0_12,plain,
s__subclass(s__GraphLoop,s__GraphArc),
inference(split_conjunct,[status(thm)],[kb_SUMO_4786]) ).
fof(c_0_13,negated_conjecture,
~ ? [X1223] : s__links(X1223,X1223,s__Arc13_1),
inference(assume_negation,[status(cth)],[prove_from_SUMO_MILO]) ).
fof(c_0_14,plain,
! [X1307,X1309] :
( ( s__instance(esk11_1(X1307),s__GraphNode)
| ~ s__instance(X1307,s__GraphLoop)
| ~ s__instance(X1307,s__GraphArc) )
& ( s__links(esk11_1(X1307),esk11_1(X1307),X1307)
| ~ s__instance(X1307,s__GraphLoop)
| ~ s__instance(X1307,s__GraphArc) )
& ( ~ s__instance(X1309,s__GraphNode)
| ~ s__links(X1309,X1309,X1307)
| s__instance(X1307,s__GraphLoop)
| ~ s__instance(X1307,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_4789])])])])])]) ).
cnf(c_0_15,plain,
( s__instance(X1,s__GraphArc)
| ~ s__instance(X1,s__GraphLoop) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
s__instance(s__Arc13_1,s__GraphLoop),
inference(split_conjunct,[status(thm)],[local_1]) ).
fof(c_0_17,negated_conjecture,
! [X1224] : ~ s__links(X1224,X1224,s__Arc13_1),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
cnf(c_0_18,plain,
( s__links(esk11_1(X1),esk11_1(X1),X1)
| ~ s__instance(X1,s__GraphLoop)
| ~ s__instance(X1,s__GraphArc) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
s__instance(s__Arc13_1,s__GraphArc),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
~ s__links(X1,X1,s__Arc13_1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_21,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_16])]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : CSR086+5 : TPTP v8.1.2. Bugfixed v7.3.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n015.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 : Fri May 3 14:43:38 EDT 2024
% 0.13/0.34 % CPUTime :
% 3.21/3.44 Running first-order model finding
% 3.21/3.44 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/tmp/tmp.chZHPGxliX/E---3.1_5113.p
% 3.57/3.89 # Version: 3.1.0
% 3.57/3.89 # Preprocessing class: FMLLSMSLSSSNFFN.
% 3.57/3.89 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.57/3.89 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 3.57/3.89 # Starting new_bool_3 with 300s (1) cores
% 3.57/3.89 # Starting new_bool_1 with 300s (1) cores
% 3.57/3.89 # Starting sh5l with 300s (1) cores
% 3.57/3.89 # new_bool_3 with pid 5543 completed with status 0
% 3.57/3.89 # Result found by new_bool_3
% 3.57/3.89 # Preprocessing class: FMLLSMSLSSSNFFN.
% 3.57/3.89 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.57/3.89 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 3.57/3.89 # Starting new_bool_3 with 300s (1) cores
% 3.57/3.89 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.57/3.89 # Search class: FHHSS-FFMM31-MFFFFFNN
% 3.57/3.89 # partial match(2): FGHSM-FFMM31-MFFFFFNN
% 3.57/3.89 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 3.57/3.89 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 3.57/3.89 # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 5546 completed with status 0
% 3.57/3.89 # Result found by G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S
% 3.57/3.89 # Preprocessing class: FMLLSMSLSSSNFFN.
% 3.57/3.89 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.57/3.89 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 3.57/3.89 # Starting new_bool_3 with 300s (1) cores
% 3.57/3.89 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.57/3.89 # Search class: FHHSS-FFMM31-MFFFFFNN
% 3.57/3.89 # partial match(2): FGHSM-FFMM31-MFFFFFNN
% 3.57/3.89 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 3.57/3.89 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 3.57/3.89 # Preprocessing time : 0.012 s
% 3.57/3.89 # Presaturation interreduction done
% 3.57/3.89
% 3.57/3.89 # Proof found!
% 3.57/3.89 # SZS status Theorem
% 3.57/3.89 # SZS output start CNFRefutation
% See solution above
% 3.57/3.89 # Parsed axioms : 16750
% 3.57/3.89 # Removed by relevancy pruning/SinE : 16696
% 3.57/3.89 # Initial clauses : 79
% 3.57/3.89 # Removed in clause preprocessing : 8
% 3.57/3.89 # Initial clauses in saturation : 71
% 3.57/3.89 # Processed clauses : 157
% 3.57/3.89 # ...of these trivial : 2
% 3.57/3.89 # ...subsumed : 0
% 3.57/3.89 # ...remaining for further processing : 155
% 3.57/3.89 # Other redundant clauses eliminated : 1
% 3.57/3.89 # Clauses deleted for lack of memory : 0
% 3.57/3.89 # Backward-subsumed : 0
% 3.57/3.89 # Backward-rewritten : 0
% 3.57/3.89 # Generated clauses : 93
% 3.57/3.89 # ...of the previous two non-redundant : 75
% 3.57/3.89 # ...aggressively subsumed : 0
% 3.57/3.89 # Contextual simplify-reflections : 19
% 3.57/3.89 # Paramodulations : 91
% 3.57/3.89 # Factorizations : 0
% 3.57/3.89 # NegExts : 0
% 3.57/3.89 # Equation resolutions : 2
% 3.57/3.89 # Disequality decompositions : 0
% 3.57/3.89 # Total rewrite steps : 14
% 3.57/3.89 # ...of those cached : 6
% 3.57/3.89 # Propositional unsat checks : 0
% 3.57/3.89 # Propositional check models : 0
% 3.57/3.89 # Propositional check unsatisfiable : 0
% 3.57/3.89 # Propositional clauses : 0
% 3.57/3.89 # Propositional clauses after purity: 0
% 3.57/3.89 # Propositional unsat core size : 0
% 3.57/3.89 # Propositional preprocessing time : 0.000
% 3.57/3.89 # Propositional encoding time : 0.000
% 3.57/3.89 # Propositional solver time : 0.000
% 3.57/3.89 # Success case prop preproc time : 0.000
% 3.57/3.89 # Success case prop encoding time : 0.000
% 3.57/3.89 # Success case prop solver time : 0.000
% 3.57/3.89 # Current number of processed clauses : 83
% 3.57/3.89 # Positive orientable unit clauses : 24
% 3.57/3.89 # Positive unorientable unit clauses: 0
% 3.57/3.89 # Negative unit clauses : 1
% 3.57/3.89 # Non-unit-clauses : 58
% 3.57/3.89 # Current number of unprocessed clauses: 56
% 3.57/3.89 # ...number of literals in the above : 93
% 3.57/3.89 # Current number of archived formulas : 0
% 3.57/3.89 # Current number of archived clauses : 71
% 3.57/3.89 # Clause-clause subsumption calls (NU) : 2801
% 3.57/3.89 # Rec. Clause-clause subsumption calls : 994
% 3.57/3.89 # Non-unit clause-clause subsumptions : 19
% 3.57/3.89 # Unit Clause-clause subsumption calls : 253
% 3.57/3.89 # Rewrite failures with RHS unbound : 0
% 3.57/3.89 # BW rewrite match attempts : 1
% 3.57/3.89 # BW rewrite match successes : 0
% 3.57/3.89 # Condensation attempts : 0
% 3.57/3.89 # Condensation successes : 0
% 3.57/3.89 # Termbank termtop insertions : 171050
% 3.57/3.89 # Search garbage collected termcells : 88121
% 3.57/3.89
% 3.57/3.89 # -------------------------------------------------
% 3.57/3.89 # User time : 0.085 s
% 3.57/3.89 # System time : 0.045 s
% 3.57/3.89 # Total time : 0.130 s
% 3.57/3.89 # Maximum resident set size: 39908 pages
% 3.57/3.89
% 3.57/3.89 # -------------------------------------------------
% 3.57/3.89 # User time : 0.366 s
% 3.57/3.89 # System time : 0.061 s
% 3.57/3.89 # Total time : 0.427 s
% 3.57/3.89 # Maximum resident set size: 18652 pages
% 3.57/3.89 % E---3.1 exiting
%------------------------------------------------------------------------------