TSTP Solution File: CSR101+2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR101+2 : TPTP v8.2.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:34 EDT 2024
% Result : Theorem 1.34s 1.19s
% Output : CNFRefutation 1.34s
% 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 : 45 ( 19 ~; 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/sandbox/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/sandbox/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/sandbox/benchmark/theBenchmark.p',prove_from_SUMO_MILO) ).
fof(local_8,axiom,
s__subclass(s__Class32_2,s__Class32_3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_8) ).
fof(local_9,axiom,
s__subclass(s__Class32_3,s__Class32_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_9) ).
fof(c_0_5,plain,
! [X1230,X1231,X1232] :
( ~ s__instance(X1231,s__SetOrClass)
| ~ s__instance(X1230,s__SetOrClass)
| ~ s__subclass(X1230,X1231)
| ~ s__instance(X1232,X1230)
| s__instance(X1232,X1231) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_27])])]) ).
fof(c_0_6,plain,
! [X1228,X1229] :
( ( s__instance(X1228,s__SetOrClass)
| ~ s__subclass(X1228,X1229) )
& ( s__instance(X1229,s__SetOrClass)
| ~ s__subclass(X1228,X1229) ) ),
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_7,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_8,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,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_11,plain,
( s__instance(X1,X2)
| ~ s__subclass(X3,X2)
| ~ s__instance(X1,X3) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).
cnf(c_0_12,plain,
s__subclass(s__Class32_2,s__Class32_3),
inference(split_conjunct,[status(thm)],[local_8]) ).
fof(c_0_13,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_10])])])]) ).
cnf(c_0_14,plain,
s__subclass(s__Class32_3,s__Class32_1),
inference(split_conjunct,[status(thm)],[local_9]) ).
cnf(c_0_15,plain,
( s__instance(X1,s__Class32_3)
| ~ s__instance(X1,s__Class32_2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
s__instance(esk1_0,s__Class32_2),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
( s__instance(X1,s__Class32_1)
| ~ s__instance(X1,s__Class32_3) ),
inference(spm,[status(thm)],[c_0_11,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
s__instance(esk1_0,s__Class32_3),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
~ s__instance(esk1_0,s__Class32_1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
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.13 % Problem : CSR101+2 : TPTP v8.2.0. Bugfixed v7.3.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n021.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun May 19 01:33:23 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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
% 1.34/1.19 # Version: 3.1.0
% 1.34/1.19 # Preprocessing class: FMLLSMSLSSSNFFN.
% 1.34/1.19 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.34/1.19 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.34/1.19 # Starting new_bool_3 with 300s (1) cores
% 1.34/1.19 # Starting new_bool_1 with 300s (1) cores
% 1.34/1.19 # Starting sh5l with 300s (1) cores
% 1.34/1.19 # new_bool_1 with pid 26444 completed with status 0
% 1.34/1.19 # Result found by new_bool_1
% 1.34/1.19 # Preprocessing class: FMLLSMSLSSSNFFN.
% 1.34/1.19 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.34/1.19 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.34/1.19 # Starting new_bool_3 with 300s (1) cores
% 1.34/1.19 # Starting new_bool_1 with 300s (1) cores
% 1.34/1.19 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.34/1.19 # Search class: FHUSF-FFMM00-SFFFFFNN
% 1.34/1.19 # partial match(1): FHUNF-FFMM00-SFFFFFNN
% 1.34/1.19 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.34/1.19 # Starting G----_0021_C18_F1_SE_CS_SP_S4S with 181s (1) cores
% 1.34/1.19 # G----_0021_C18_F1_SE_CS_SP_S4S with pid 26446 completed with status 0
% 1.34/1.19 # Result found by G----_0021_C18_F1_SE_CS_SP_S4S
% 1.34/1.19 # Preprocessing class: FMLLSMSLSSSNFFN.
% 1.34/1.19 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.34/1.19 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.34/1.19 # Starting new_bool_3 with 300s (1) cores
% 1.34/1.19 # Starting new_bool_1 with 300s (1) cores
% 1.34/1.19 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.34/1.19 # Search class: FHUSF-FFMM00-SFFFFFNN
% 1.34/1.19 # partial match(1): FHUNF-FFMM00-SFFFFFNN
% 1.34/1.19 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.34/1.19 # Starting G----_0021_C18_F1_SE_CS_SP_S4S with 181s (1) cores
% 1.34/1.19 # Preprocessing time : 0.009 s
% 1.34/1.19
% 1.34/1.19 # Proof found!
% 1.34/1.19 # SZS status Theorem
% 1.34/1.19 # SZS output start CNFRefutation
% See solution above
% 1.34/1.19 # Parsed axioms : 37991
% 1.34/1.19 # Removed by relevancy pruning/SinE : 37910
% 1.34/1.19 # Initial clauses : 86
% 1.34/1.19 # Removed in clause preprocessing : 4
% 1.34/1.19 # Initial clauses in saturation : 82
% 1.34/1.19 # Processed clauses : 123
% 1.34/1.19 # ...of these trivial : 3
% 1.34/1.19 # ...subsumed : 0
% 1.34/1.19 # ...remaining for further processing : 120
% 1.34/1.19 # Other redundant clauses eliminated : 0
% 1.34/1.19 # Clauses deleted for lack of memory : 0
% 1.34/1.19 # Backward-subsumed : 0
% 1.34/1.19 # Backward-rewritten : 0
% 1.34/1.19 # Generated clauses : 277
% 1.34/1.19 # ...of the previous two non-redundant : 94
% 1.34/1.19 # ...aggressively subsumed : 0
% 1.34/1.19 # Contextual simplify-reflections : 2
% 1.34/1.19 # Paramodulations : 277
% 1.34/1.19 # Factorizations : 0
% 1.34/1.19 # NegExts : 0
% 1.34/1.19 # Equation resolutions : 0
% 1.34/1.20 # Disequality decompositions : 0
% 1.34/1.20 # Total rewrite steps : 167
% 1.34/1.20 # ...of those cached : 144
% 1.34/1.20 # Propositional unsat checks : 0
% 1.34/1.20 # Propositional check models : 0
% 1.34/1.20 # Propositional check unsatisfiable : 0
% 1.34/1.20 # Propositional clauses : 0
% 1.34/1.20 # Propositional clauses after purity: 0
% 1.34/1.20 # Propositional unsat core size : 0
% 1.34/1.20 # Propositional preprocessing time : 0.000
% 1.34/1.20 # Propositional encoding time : 0.000
% 1.34/1.20 # Propositional solver time : 0.000
% 1.34/1.20 # Success case prop preproc time : 0.000
% 1.34/1.20 # Success case prop encoding time : 0.000
% 1.34/1.20 # Success case prop solver time : 0.000
% 1.34/1.20 # Current number of processed clauses : 120
% 1.34/1.20 # Positive orientable unit clauses : 112
% 1.34/1.20 # Positive unorientable unit clauses: 0
% 1.34/1.20 # Negative unit clauses : 1
% 1.34/1.20 # Non-unit-clauses : 7
% 1.34/1.20 # Current number of unprocessed clauses: 53
% 1.34/1.20 # ...number of literals in the above : 115
% 1.34/1.20 # Current number of archived formulas : 0
% 1.34/1.20 # Current number of archived clauses : 0
% 1.34/1.20 # Clause-clause subsumption calls (NU) : 5
% 1.34/1.20 # Rec. Clause-clause subsumption calls : 5
% 1.34/1.20 # Non-unit clause-clause subsumptions : 2
% 1.34/1.20 # Unit Clause-clause subsumption calls : 4
% 1.34/1.20 # Rewrite failures with RHS unbound : 0
% 1.34/1.20 # BW rewrite match attempts : 0
% 1.34/1.20 # BW rewrite match successes : 0
% 1.34/1.20 # Condensation attempts : 0
% 1.34/1.20 # Condensation successes : 0
% 1.34/1.20 # Termbank termtop insertions : 251707
% 1.34/1.20 # Search garbage collected termcells : 125535
% 1.34/1.20
% 1.34/1.20 # -------------------------------------------------
% 1.34/1.20 # User time : 0.090 s
% 1.34/1.20 # System time : 0.044 s
% 1.34/1.20 # Total time : 0.134 s
% 1.34/1.20 # Maximum resident set size: 49268 pages
% 1.34/1.20
% 1.34/1.20 # -------------------------------------------------
% 1.34/1.20 # User time : 0.586 s
% 1.34/1.20 # System time : 0.074 s
% 1.34/1.20 # Total time : 0.660 s
% 1.34/1.20 # Maximum resident set size: 27836 pages
% 1.34/1.20 % E---3.1 exiting
% 1.34/1.20 % E exiting
%------------------------------------------------------------------------------