TSTP Solution File: CSR101+5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR101+5 : TPTP v8.2.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:35 EDT 2024
% Result : Theorem 0.84s 1.01s
% Output : CNFRefutation 0.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 21 ( 8 unt; 0 def)
% Number of atoms : 47 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 46 ( 20 ~; 16 |; 5 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 24 ( 2 sgn 12 !; 0 ?)
% 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/sandbox2/benchmark/Axioms/CSR003+1.ax',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/sandbox2/benchmark/Axioms/CSR003+1.ax',kb_SUMO_26) ).
fof(prove_from_SUMO_MILO,conjecture,
! [X1223] :
( s__instance(X1223,s__Class32_2)
=> s__instance(X1223,s__Class32_1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_from_SUMO_MILO) ).
fof(local_9,axiom,
s__subclass(s__Class32_3,s__Class32_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_9) ).
fof(local_8,axiom,
s__subclass(s__Class32_2,s__Class32_3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_8) ).
fof(c_0_5,plain,
! [X1228,X1229,X1230] :
( ~ s__instance(X1229,s__SetOrClass)
| ~ s__instance(X1228,s__SetOrClass)
| ~ s__subclass(X1228,X1229)
| ~ s__instance(X1230,X1228)
| s__instance(X1230,X1229) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_27])])]) ).
fof(c_0_6,plain,
! [X1226,X1227] :
( ( s__instance(X1226,s__SetOrClass)
| ~ s__subclass(X1226,X1227) )
& ( s__instance(X1227,s__SetOrClass)
| ~ s__subclass(X1226,X1227) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26])])])]) ).
fof(c_0_7,negated_conjecture,
~ ! [X1223] :
( s__instance(X1223,s__Class32_2)
=> s__instance(X1223,s__Class32_1) ),
inference(assume_negation,[status(cth)],[prove_from_SUMO_MILO]) ).
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_5]) ).
cnf(c_0_9,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_11,negated_conjecture,
( s__instance(esk1_0,s__Class32_2)
& ~ s__instance(esk1_0,s__Class32_1) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
cnf(c_0_12,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_13,plain,
s__subclass(s__Class32_3,s__Class32_1),
inference(split_conjunct,[status(thm)],[local_9]) ).
cnf(c_0_14,plain,
s__subclass(s__Class32_2,s__Class32_3),
inference(split_conjunct,[status(thm)],[local_8]) ).
cnf(c_0_15,negated_conjecture,
~ s__instance(esk1_0,s__Class32_1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( s__instance(X1,s__Class32_1)
| ~ s__instance(X1,s__Class32_3) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
( s__instance(X1,s__Class32_3)
| ~ s__instance(X1,s__Class32_2) ),
inference(spm,[status(thm)],[c_0_12,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
s__instance(esk1_0,s__Class32_2),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,negated_conjecture,
~ s__instance(esk1_0,s__Class32_3),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.17 % Problem : CSR101+5 : TPTP v8.2.0. Bugfixed v7.3.0.
% 0.14/0.18 % Command : run_E %s %d THM
% 0.16/0.41 % Computer : n004.cluster.edu
% 0.16/0.41 % Model : x86_64 x86_64
% 0.16/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.41 % Memory : 8042.1875MB
% 0.16/0.41 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.41 % CPULimit : 300
% 0.16/0.41 % WCLimit : 300
% 0.16/0.41 % DateTime : Sun May 19 00:33:23 EDT 2024
% 0.16/0.41 % CPUTime :
% 0.23/0.58 Running first-order theorem proving
% 0.23/0.58 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.84/1.01 # Version: 3.1.0
% 0.84/1.01 # Preprocessing class: FMLLSMSLSSSNFFN.
% 0.84/1.01 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.84/1.01 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.84/1.01 # Starting new_bool_3 with 300s (1) cores
% 0.84/1.01 # Starting new_bool_1 with 300s (1) cores
% 0.84/1.01 # Starting sh5l with 300s (1) cores
% 0.84/1.01 # new_bool_1 with pid 21938 completed with status 0
% 0.84/1.01 # Result found by new_bool_1
% 0.84/1.01 # Preprocessing class: FMLLSMSLSSSNFFN.
% 0.84/1.01 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.84/1.01 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.84/1.01 # Starting new_bool_3 with 300s (1) cores
% 0.84/1.01 # Starting new_bool_1 with 300s (1) cores
% 0.84/1.01 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.84/1.01 # Search class: FHUSF-FFMM32-SFFFFFNN
% 0.84/1.01 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.84/1.01 # Starting G-E--_208_C18CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 150s (1) cores
% 0.84/1.01 # G-E--_208_C18CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 21940 completed with status 0
% 0.84/1.01 # Result found by G-E--_208_C18CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.84/1.01 # Preprocessing class: FMLLSMSLSSSNFFN.
% 0.84/1.01 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.84/1.01 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.84/1.01 # Starting new_bool_3 with 300s (1) cores
% 0.84/1.01 # Starting new_bool_1 with 300s (1) cores
% 0.84/1.01 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.84/1.01 # Search class: FHUSF-FFMM32-SFFFFFNN
% 0.84/1.01 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.84/1.01 # Starting G-E--_208_C18CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 150s (1) cores
% 0.84/1.01 # Preprocessing time : 0.007 s
% 0.84/1.01 # Presaturation interreduction done
% 0.84/1.01
% 0.84/1.01 # Proof found!
% 0.84/1.01 # SZS status Theorem
% 0.84/1.01 # SZS output start CNFRefutation
% See solution above
% 0.84/1.01 # Parsed axioms : 16758
% 0.84/1.01 # Removed by relevancy pruning/SinE : 16724
% 0.84/1.01 # Initial clauses : 39
% 0.84/1.01 # Removed in clause preprocessing : 4
% 0.84/1.01 # Initial clauses in saturation : 35
% 0.84/1.01 # Processed clauses : 91
% 0.84/1.01 # ...of these trivial : 17
% 0.84/1.01 # ...subsumed : 0
% 0.84/1.01 # ...remaining for further processing : 74
% 0.84/1.01 # Other redundant clauses eliminated : 0
% 0.84/1.01 # Clauses deleted for lack of memory : 0
% 0.84/1.01 # Backward-subsumed : 0
% 0.84/1.01 # Backward-rewritten : 1
% 0.84/1.01 # Generated clauses : 53
% 0.84/1.01 # ...of the previous two non-redundant : 40
% 0.84/1.01 # ...aggressively subsumed : 0
% 0.84/1.01 # Contextual simplify-reflections : 8
% 0.84/1.01 # Paramodulations : 53
% 0.84/1.01 # Factorizations : 0
% 0.84/1.01 # NegExts : 0
% 0.84/1.01 # Equation resolutions : 0
% 0.84/1.01 # Disequality decompositions : 0
% 0.84/1.01 # Total rewrite steps : 25
% 0.84/1.01 # ...of those cached : 13
% 0.84/1.01 # Propositional unsat checks : 0
% 0.84/1.01 # Propositional check models : 0
% 0.84/1.01 # Propositional check unsatisfiable : 0
% 0.84/1.01 # Propositional clauses : 0
% 0.84/1.01 # Propositional clauses after purity: 0
% 0.84/1.01 # Propositional unsat core size : 0
% 0.84/1.01 # Propositional preprocessing time : 0.000
% 0.84/1.01 # Propositional encoding time : 0.000
% 0.84/1.01 # Propositional solver time : 0.000
% 0.84/1.01 # Success case prop preproc time : 0.000
% 0.84/1.01 # Success case prop encoding time : 0.000
% 0.84/1.01 # Success case prop solver time : 0.000
% 0.84/1.01 # Current number of processed clauses : 49
% 0.84/1.01 # Positive orientable unit clauses : 27
% 0.84/1.01 # Positive unorientable unit clauses: 0
% 0.84/1.01 # Negative unit clauses : 2
% 0.84/1.01 # Non-unit-clauses : 20
% 0.84/1.01 # Current number of unprocessed clauses: 8
% 0.84/1.01 # ...number of literals in the above : 19
% 0.84/1.01 # Current number of archived formulas : 0
% 0.84/1.01 # Current number of archived clauses : 25
% 0.84/1.01 # Clause-clause subsumption calls (NU) : 27
% 0.84/1.01 # Rec. Clause-clause subsumption calls : 21
% 0.84/1.01 # Non-unit clause-clause subsumptions : 8
% 0.84/1.01 # Unit Clause-clause subsumption calls : 2
% 0.84/1.01 # Rewrite failures with RHS unbound : 0
% 0.84/1.01 # BW rewrite match attempts : 1
% 0.84/1.01 # BW rewrite match successes : 1
% 0.84/1.01 # Condensation attempts : 0
% 0.84/1.01 # Condensation successes : 0
% 0.84/1.01 # Termbank termtop insertions : 165444
% 0.84/1.01 # Search garbage collected termcells : 87491
% 0.84/1.01
% 0.84/1.01 # -------------------------------------------------
% 0.84/1.01 # User time : 0.056 s
% 0.84/1.01 # System time : 0.032 s
% 0.84/1.01 # Total time : 0.087 s
% 0.84/1.01 # Maximum resident set size: 39668 pages
% 0.84/1.01
% 0.84/1.01 # -------------------------------------------------
% 0.84/1.01 # User time : 0.333 s
% 0.84/1.01 # System time : 0.051 s
% 0.84/1.01 # Total time : 0.384 s
% 0.84/1.01 # Maximum resident set size: 18408 pages
% 0.84/1.01 % E---3.1 exiting
% 0.84/1.01 % E exiting
%------------------------------------------------------------------------------