TSTP Solution File: CSR100+3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR100+3 : TPTP v8.2.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:33 EDT 2024
% Result : Theorem 5.64s 3.67s
% Output : CNFRefutation 5.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 22 ( 12 unt; 0 def)
% Number of atoms : 45 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 42 ( 19 ~; 16 |; 4 &)
% ( 0 <=>; 3 =>; 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 : 22 ( 2 sgn 10 !; 0 ?)
% 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(local_8,axiom,
s__subclass(s__Class31_2,s__Class31_3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_8) ).
fof(prove_from_ALL,conjecture,
s__instance(s__Animal31,s__Class31_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_from_ALL) ).
fof(local_9,axiom,
s__subclass(s__Class31_3,s__Class31_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_9) ).
fof(local_10,axiom,
s__instance(s__Animal31,s__Class31_2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_10) ).
fof(c_0_6,plain,
! [X2346,X2347,X2348] :
( ~ s__instance(X2347,s__SetOrClass)
| ~ s__instance(X2346,s__SetOrClass)
| ~ s__subclass(X2346,X2347)
| ~ s__instance(X2348,X2346)
| s__instance(X2348,X2347) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26636])])]) ).
fof(c_0_7,plain,
! [X2344,X2345] :
( ( s__instance(X2344,s__SetOrClass)
| ~ s__subclass(X2344,X2345) )
& ( s__instance(X2345,s__SetOrClass)
| ~ s__subclass(X2344,X2345) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26635])])])]) ).
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__instance(X1,X3)
| ~ s__subclass(X3,X2) ),
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__Class31_2,s__Class31_3),
inference(split_conjunct,[status(thm)],[local_8]) ).
fof(c_0_13,negated_conjecture,
~ s__instance(s__Animal31,s__Class31_1),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[prove_from_ALL])]) ).
cnf(c_0_14,plain,
s__subclass(s__Class31_3,s__Class31_1),
inference(split_conjunct,[status(thm)],[local_9]) ).
cnf(c_0_15,plain,
( s__instance(X1,s__Class31_3)
| ~ s__instance(X1,s__Class31_2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
s__instance(s__Animal31,s__Class31_2),
inference(split_conjunct,[status(thm)],[local_10]) ).
fof(c_0_17,negated_conjecture,
~ s__instance(s__Animal31,s__Class31_1),
inference(fof_nnf,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( s__instance(X1,s__Class31_1)
| ~ s__instance(X1,s__Class31_3) ),
inference(spm,[status(thm)],[c_0_11,c_0_14]) ).
cnf(c_0_19,plain,
s__instance(s__Animal31,s__Class31_3),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
~ s__instance(s__Animal31,s__Class31_1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_21,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CSR100+3 : TPTP v8.2.0. Bugfixed v7.3.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.14/0.33 % Computer : n028.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 02:26:38 EDT 2024
% 0.14/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
% 5.64/3.67 # Version: 3.1.0
% 5.64/3.67 # Preprocessing class: FLLLSMSLSSSNFFN.
% 5.64/3.67 # Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 5.64/3.67 # Starting G-E--_300_C01_S5PRR_S00 with 1490s (5) cores
% 5.64/3.67 # Starting new_bool_3 with 298s (1) cores
% 5.64/3.67 # Starting new_bool_1 with 298s (1) cores
% 5.64/3.67 # Starting sh5l with 298s (1) cores
% 5.64/3.67 # new_bool_3 with pid 5803 completed with status 0
% 5.64/3.67 # Result found by new_bool_3
% 5.64/3.67 # Preprocessing class: FLLLSMSLSSSNFFN.
% 5.64/3.67 # Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 5.64/3.67 # Starting G-E--_300_C01_S5PRR_S00 with 1490s (5) cores
% 5.64/3.67 # Starting new_bool_3 with 298s (1) cores
% 5.64/3.67 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.64/3.67 # Search class: FHUSF-FFMM00-SFFFFFNN
% 5.64/3.67 # partial match(1): FHUNF-FFMM00-SFFFFFNN
% 5.64/3.67 # Scheduled 5 strats onto 1 cores with 298 seconds (298 total)
% 5.64/3.67 # Starting G----_0021_C18_F1_SE_CS_SP_S4S with 179s (1) cores
% 5.64/3.67 # G----_0021_C18_F1_SE_CS_SP_S4S with pid 5807 completed with status 0
% 5.64/3.67 # Result found by G----_0021_C18_F1_SE_CS_SP_S4S
% 5.64/3.67 # Preprocessing class: FLLLSMSLSSSNFFN.
% 5.64/3.67 # Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 5.64/3.67 # Starting G-E--_300_C01_S5PRR_S00 with 1490s (5) cores
% 5.64/3.67 # Starting new_bool_3 with 298s (1) cores
% 5.64/3.67 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.64/3.67 # Search class: FHUSF-FFMM00-SFFFFFNN
% 5.64/3.67 # partial match(1): FHUNF-FFMM00-SFFFFFNN
% 5.64/3.67 # Scheduled 5 strats onto 1 cores with 298 seconds (298 total)
% 5.64/3.67 # Starting G----_0021_C18_F1_SE_CS_SP_S4S with 179s (1) cores
% 5.64/3.67 # Preprocessing time : 0.077 s
% 5.64/3.67
% 5.64/3.67 # Proof found!
% 5.64/3.67 # SZS status Theorem
% 5.64/3.67 # SZS output start CNFRefutation
% See solution above
% 5.64/3.67 # Parsed axioms : 145112
% 5.64/3.67 # Removed by relevancy pruning/SinE : 145029
% 5.64/3.67 # Initial clauses : 87
% 5.64/3.67 # Removed in clause preprocessing : 4
% 5.64/3.67 # Initial clauses in saturation : 83
% 5.64/3.67 # Processed clauses : 127
% 5.64/3.67 # ...of these trivial : 2
% 5.64/3.67 # ...subsumed : 0
% 5.64/3.67 # ...remaining for further processing : 125
% 5.64/3.67 # Other redundant clauses eliminated : 0
% 5.64/3.67 # Clauses deleted for lack of memory : 0
% 5.64/3.67 # Backward-subsumed : 0
% 5.64/3.67 # Backward-rewritten : 0
% 5.64/3.67 # Generated clauses : 285
% 5.64/3.67 # ...of the previous two non-redundant : 96
% 5.64/3.67 # ...aggressively subsumed : 0
% 5.64/3.67 # Contextual simplify-reflections : 2
% 5.64/3.67 # Paramodulations : 285
% 5.64/3.67 # Factorizations : 0
% 5.64/3.67 # NegExts : 0
% 5.64/3.67 # Equation resolutions : 0
% 5.64/3.67 # Disequality decompositions : 0
% 5.64/3.67 # Total rewrite steps : 170
% 5.64/3.67 # ...of those cached : 146
% 5.64/3.67 # Propositional unsat checks : 0
% 5.64/3.67 # Propositional check models : 0
% 5.64/3.67 # Propositional check unsatisfiable : 0
% 5.64/3.67 # Propositional clauses : 0
% 5.64/3.67 # Propositional clauses after purity: 0
% 5.64/3.67 # Propositional unsat core size : 0
% 5.64/3.67 # Propositional preprocessing time : 0.000
% 5.64/3.67 # Propositional encoding time : 0.000
% 5.64/3.67 # Propositional solver time : 0.000
% 5.64/3.67 # Success case prop preproc time : 0.000
% 5.64/3.67 # Success case prop encoding time : 0.000
% 5.64/3.67 # Success case prop solver time : 0.000
% 5.64/3.67 # Current number of processed clauses : 125
% 5.64/3.67 # Positive orientable unit clauses : 115
% 5.64/3.67 # Positive unorientable unit clauses: 0
% 5.64/3.67 # Negative unit clauses : 1
% 5.64/3.67 # Non-unit-clauses : 9
% 5.64/3.67 # Current number of unprocessed clauses: 52
% 5.64/3.67 # ...number of literals in the above : 113
% 5.64/3.67 # Current number of archived formulas : 0
% 5.64/3.67 # Current number of archived clauses : 0
% 5.64/3.67 # Clause-clause subsumption calls (NU) : 7
% 5.64/3.67 # Rec. Clause-clause subsumption calls : 6
% 5.64/3.67 # Non-unit clause-clause subsumptions : 2
% 5.64/3.67 # Unit Clause-clause subsumption calls : 10
% 5.64/3.67 # Rewrite failures with RHS unbound : 0
% 5.64/3.67 # BW rewrite match attempts : 0
% 5.64/3.67 # BW rewrite match successes : 0
% 5.64/3.67 # Condensation attempts : 0
% 5.64/3.67 # Condensation successes : 0
% 5.64/3.67 # Termbank termtop insertions : 1010044
% 5.64/3.67 # Search garbage collected termcells : 459525
% 5.64/3.67
% 5.64/3.67 # -------------------------------------------------
% 5.64/3.67 # User time : 0.364 s
% 5.64/3.67 # System time : 0.194 s
% 5.64/3.67 # Total time : 0.558 s
% 5.64/3.67 # Maximum resident set size: 172668 pages
% 5.64/3.67
% 5.64/3.67 # -------------------------------------------------
% 5.64/3.67 # User time : 2.817 s
% 5.64/3.67 # System time : 0.289 s
% 5.64/3.67 # Total time : 3.106 s
% 5.64/3.67 # Maximum resident set size: 98048 pages
% 5.64/3.67 % E---3.1 exiting
% 5.64/3.67 % E exiting
%------------------------------------------------------------------------------