TSTP Solution File: CSR099+4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR099+4 : TPTP v8.1.2. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:32 EDT 2024
% Result : Theorem 2.02s 2.14s
% Output : CNFRefutation 2.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 16 ( 9 unt; 0 def)
% Number of atoms : 36 ( 8 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 36 ( 16 ~; 13 |; 4 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 14 ( 1 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(kb_SUMO_1220,axiom,
! [X4,X5] :
( ( s__instance(X5,s__SetOrClass)
& s__instance(X4,s__SetOrClass) )
=> ( ( s__subclass(X4,X5)
& s__subclass(X5,X4) )
=> X4 = X5 ) ),
file('/export/starexec/sandbox/tmp/tmp.UA7WvMc6PG/E---3.1_21844.p',kb_SUMO_1220) ).
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.UA7WvMc6PG/E---3.1_21844.p',kb_SUMO_26) ).
fof(prove_from_SUMO,conjecture,
s__Class30_1 = s__Reptile,
file('/export/starexec/sandbox/tmp/tmp.UA7WvMc6PG/E---3.1_21844.p',prove_from_SUMO) ).
fof(local_2,axiom,
s__subclass(s__Class30_1,s__Reptile),
file('/export/starexec/sandbox/tmp/tmp.UA7WvMc6PG/E---3.1_21844.p',local_2) ).
fof(local_3,axiom,
s__subclass(s__Reptile,s__Class30_1),
file('/export/starexec/sandbox/tmp/tmp.UA7WvMc6PG/E---3.1_21844.p',local_3) ).
fof(c_0_5,plain,
! [X597,X598] :
( ~ s__instance(X598,s__SetOrClass)
| ~ s__instance(X597,s__SetOrClass)
| ~ s__subclass(X597,X598)
| ~ s__subclass(X598,X597)
| X597 = X598 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_1220])])]) ).
fof(c_0_6,plain,
! [X591,X592] :
( ( s__instance(X591,s__SetOrClass)
| ~ s__subclass(X591,X592) )
& ( s__instance(X592,s__SetOrClass)
| ~ s__subclass(X591,X592) ) ),
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,
s__Class30_1 != s__Reptile,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[prove_from_SUMO])]) ).
cnf(c_0_8,plain,
( X2 = X1
| ~ s__instance(X1,s__SetOrClass)
| ~ s__instance(X2,s__SetOrClass)
| ~ s__subclass(X2,X1)
| ~ s__subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
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,
s__Class30_1 != s__Reptile,
inference(fof_nnf,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( X1 = X2
| ~ s__subclass(X2,X1)
| ~ s__subclass(X1,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_8,c_0_9]),c_0_9]) ).
cnf(c_0_12,plain,
s__subclass(s__Class30_1,s__Reptile),
inference(split_conjunct,[status(thm)],[local_2]) ).
cnf(c_0_13,plain,
s__subclass(s__Reptile,s__Class30_1),
inference(split_conjunct,[status(thm)],[local_3]) ).
cnf(c_0_14,negated_conjecture,
s__Class30_1 != s__Reptile,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.83/0.86 % Problem : CSR099+4 : TPTP v8.1.2. Bugfixed v7.3.0.
% 0.83/0.87 % Command : run_E %s %d THM
% 0.87/1.07 % Computer : n032.cluster.edu
% 0.87/1.07 % Model : x86_64 x86_64
% 0.87/1.07 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.87/1.07 % Memory : 8042.1875MB
% 0.87/1.07 % OS : Linux 3.10.0-693.el7.x86_64
% 0.87/1.07 % CPULimit : 300
% 0.87/1.07 % WCLimit : 300
% 0.87/1.07 % DateTime : Fri May 3 15:15:23 EDT 2024
% 0.87/1.07 % CPUTime :
% 1.73/1.98 Running first-order theorem proving
% 1.73/1.98 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.UA7WvMc6PG/E---3.1_21844.p
% 2.02/2.14 # Version: 3.1.0
% 2.02/2.14 # Preprocessing class: FMLLSMSLSSSNFFN.
% 2.02/2.14 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.02/2.14 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.02/2.14 # Starting new_bool_3 with 300s (1) cores
% 2.02/2.14 # Starting new_bool_1 with 300s (1) cores
% 2.02/2.14 # Starting sh5l with 300s (1) cores
% 2.02/2.14 # new_bool_1 with pid 21924 completed with status 0
% 2.02/2.14 # Result found by new_bool_1
% 2.02/2.14 # Preprocessing class: FMLLSMSLSSSNFFN.
% 2.02/2.14 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.02/2.14 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.02/2.14 # Starting new_bool_3 with 300s (1) cores
% 2.02/2.14 # Starting new_bool_1 with 300s (1) cores
% 2.02/2.14 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.02/2.14 # Search class: FGHSF-FFMM21-SFFFFFNN
% 2.02/2.14 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 2.02/2.14 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 2.02/2.14 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 21927 completed with status 0
% 2.02/2.14 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 2.02/2.14 # Preprocessing class: FMLLSMSLSSSNFFN.
% 2.02/2.14 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.02/2.14 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.02/2.14 # Starting new_bool_3 with 300s (1) cores
% 2.02/2.14 # Starting new_bool_1 with 300s (1) cores
% 2.02/2.14 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.02/2.14 # Search class: FGHSF-FFMM21-SFFFFFNN
% 2.02/2.14 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 2.02/2.14 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 2.02/2.14 # Preprocessing time : 0.004 s
% 2.02/2.14 # Presaturation interreduction done
% 2.02/2.14
% 2.02/2.14 # Proof found!
% 2.02/2.14 # SZS status Theorem
% 2.02/2.14 # SZS output start CNFRefutation
% See solution above
% 2.02/2.14 # Parsed axioms : 7221
% 2.02/2.14 # Removed by relevancy pruning/SinE : 7184
% 2.02/2.14 # Initial clauses : 47
% 2.02/2.14 # Removed in clause preprocessing : 4
% 2.02/2.14 # Initial clauses in saturation : 43
% 2.02/2.14 # Processed clauses : 105
% 2.02/2.14 # ...of these trivial : 14
% 2.02/2.14 # ...subsumed : 1
% 2.02/2.14 # ...remaining for further processing : 90
% 2.02/2.14 # Other redundant clauses eliminated : 0
% 2.02/2.14 # Clauses deleted for lack of memory : 0
% 2.02/2.14 # Backward-subsumed : 0
% 2.02/2.14 # Backward-rewritten : 3
% 2.02/2.14 # Generated clauses : 90
% 2.02/2.14 # ...of the previous two non-redundant : 66
% 2.02/2.14 # ...aggressively subsumed : 0
% 2.02/2.14 # Contextual simplify-reflections : 10
% 2.02/2.14 # Paramodulations : 90
% 2.02/2.14 # Factorizations : 0
% 2.02/2.14 # NegExts : 0
% 2.02/2.14 # Equation resolutions : 0
% 2.02/2.14 # Disequality decompositions : 0
% 2.02/2.14 # Total rewrite steps : 36
% 2.02/2.14 # ...of those cached : 21
% 2.02/2.14 # Propositional unsat checks : 0
% 2.02/2.14 # Propositional check models : 0
% 2.02/2.14 # Propositional check unsatisfiable : 0
% 2.02/2.14 # Propositional clauses : 0
% 2.02/2.14 # Propositional clauses after purity: 0
% 2.02/2.14 # Propositional unsat core size : 0
% 2.02/2.14 # Propositional preprocessing time : 0.000
% 2.02/2.14 # Propositional encoding time : 0.000
% 2.02/2.14 # Propositional solver time : 0.000
% 2.02/2.14 # Success case prop preproc time : 0.000
% 2.02/2.14 # Success case prop encoding time : 0.000
% 2.02/2.14 # Success case prop solver time : 0.000
% 2.02/2.14 # Current number of processed clauses : 52
% 2.02/2.14 # Positive orientable unit clauses : 32
% 2.02/2.14 # Positive unorientable unit clauses: 0
% 2.02/2.14 # Negative unit clauses : 1
% 2.02/2.14 # Non-unit-clauses : 19
% 2.02/2.14 # Current number of unprocessed clauses: 39
% 2.02/2.14 # ...number of literals in the above : 90
% 2.02/2.14 # Current number of archived formulas : 0
% 2.02/2.14 # Current number of archived clauses : 38
% 2.02/2.14 # Clause-clause subsumption calls (NU) : 81
% 2.02/2.14 # Rec. Clause-clause subsumption calls : 62
% 2.02/2.14 # Non-unit clause-clause subsumptions : 11
% 2.02/2.14 # Unit Clause-clause subsumption calls : 21
% 2.02/2.14 # Rewrite failures with RHS unbound : 0
% 2.02/2.14 # BW rewrite match attempts : 2
% 2.02/2.14 # BW rewrite match successes : 2
% 2.02/2.14 # Condensation attempts : 0
% 2.02/2.14 # Condensation successes : 0
% 2.02/2.14 # Termbank termtop insertions : 80325
% 2.02/2.14 # Search garbage collected termcells : 39405
% 2.02/2.14
% 2.02/2.14 # -------------------------------------------------
% 2.02/2.14 # User time : 0.036 s
% 2.02/2.14 # System time : 0.017 s
% 2.02/2.14 # Total time : 0.053 s
% 2.02/2.14 # Maximum resident set size: 16664 pages
% 2.02/2.14
% 2.02/2.14 # -------------------------------------------------
% 2.02/2.14 # User time : 0.129 s
% 2.02/2.14 # System time : 0.028 s
% 2.02/2.14 # Total time : 0.157 s
% 2.02/2.14 # Maximum resident set size: 9168 pages
% 2.02/2.14 % E---3.1 exiting
% 2.02/2.15 % E exiting
%------------------------------------------------------------------------------