TSTP Solution File: CSR099+6 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : CSR099+6 : TPTP v8.2.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:18:32 EDT 2024
% Result : Theorem 1.99s 2.24s
% Output : CNFRefutation 1.99s
% 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_28267,axiom,
! [X1034,X1035] :
( ( s__instance(X1035,s__SetOrClass)
& s__instance(X1034,s__SetOrClass) )
=> ( ( s__subclass(X1034,X1035)
& s__subclass(X1035,X1034) )
=> X1034 = X1035 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+2.ax',kb_SUMO_28267) ).
fof(kb_SUMO_26635,axiom,
! [X1,X15] :
( s__subclass(X1,X15)
=> ( s__instance(X1,s__SetOrClass)
& s__instance(X15,s__SetOrClass) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+2.ax',kb_SUMO_26635) ).
fof(prove_from_ALL,conjecture,
s__Class30_1 = s__Reptile,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_from_ALL) ).
fof(local_2,axiom,
s__subclass(s__Class30_1,s__Reptile),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_2) ).
fof(local_3,axiom,
s__subclass(s__Reptile,s__Class30_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_3) ).
fof(c_0_5,plain,
! [X2347,X2348] :
( ~ s__instance(X2348,s__SetOrClass)
| ~ s__instance(X2347,s__SetOrClass)
| ~ s__subclass(X2347,X2348)
| ~ s__subclass(X2348,X2347)
| X2347 = X2348 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_28267])])]) ).
fof(c_0_6,plain,
! [X2341,X2342] :
( ( s__instance(X2341,s__SetOrClass)
| ~ s__subclass(X2341,X2342) )
& ( s__instance(X2342,s__SetOrClass)
| ~ s__subclass(X2341,X2342) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26635])])])]) ).
fof(c_0_7,negated_conjecture,
s__Class30_1 != s__Reptile,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[prove_from_ALL])]) ).
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.10/0.11 % Problem : CSR099+6 : TPTP v8.2.0. Bugfixed v7.3.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n020.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Sun May 19 02:28:08 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.17/0.44 Running first-order model finding
% 0.17/0.44 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 1.99/2.24 # Version: 3.1.0
% 1.99/2.24 # Preprocessing class: FMLLSMSLSSSNFFN.
% 1.99/2.24 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 1.99/2.24 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1495s (5) cores
% 1.99/2.24 # Starting new_bool_3 with 299s (1) cores
% 1.99/2.24 # Starting new_bool_1 with 299s (1) cores
% 1.99/2.24 # Starting sh5l with 299s (1) cores
% 1.99/2.24 # new_bool_3 with pid 13192 completed with status 0
% 1.99/2.24 # Result found by new_bool_3
% 1.99/2.24 # Preprocessing class: FMLLSMSLSSSNFFN.
% 1.99/2.24 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 1.99/2.24 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1495s (5) cores
% 1.99/2.24 # Starting new_bool_3 with 299s (1) cores
% 1.99/2.24 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.99/2.24 # Search class: FGHSF-FFMM32-SFFFFFNN
% 1.99/2.24 # Scheduled 6 strats onto 1 cores with 299 seconds (299 total)
% 1.99/2.24 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 162s (1) cores
% 1.99/2.24 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with pid 13195 completed with status 0
% 1.99/2.24 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA
% 1.99/2.24 # Preprocessing class: FMLLSMSLSSSNFFN.
% 1.99/2.24 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 1.99/2.24 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1495s (5) cores
% 1.99/2.24 # Starting new_bool_3 with 299s (1) cores
% 1.99/2.24 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.99/2.24 # Search class: FGHSF-FFMM32-SFFFFFNN
% 1.99/2.24 # Scheduled 6 strats onto 1 cores with 299 seconds (299 total)
% 1.99/2.24 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 162s (1) cores
% 1.99/2.24 # Preprocessing time : 0.055 s
% 1.99/2.24 # Presaturation interreduction done
% 1.99/2.24
% 1.99/2.24 # Proof found!
% 1.99/2.24 # SZS status Theorem
% 1.99/2.24 # SZS output start CNFRefutation
% See solution above
% 1.99/2.24 # Parsed axioms : 55590
% 1.99/2.24 # Removed by relevancy pruning/SinE : 55545
% 1.99/2.24 # Initial clauses : 75
% 1.99/2.24 # Removed in clause preprocessing : 6
% 1.99/2.24 # Initial clauses in saturation : 69
% 1.99/2.24 # Processed clauses : 101
% 1.99/2.24 # ...of these trivial : 0
% 1.99/2.24 # ...subsumed : 0
% 1.99/2.24 # ...remaining for further processing : 101
% 1.99/2.24 # Other redundant clauses eliminated : 6
% 1.99/2.24 # Clauses deleted for lack of memory : 0
% 1.99/2.24 # Backward-subsumed : 0
% 1.99/2.24 # Backward-rewritten : 0
% 1.99/2.24 # Generated clauses : 39
% 1.99/2.24 # ...of the previous two non-redundant : 28
% 1.99/2.24 # ...aggressively subsumed : 0
% 1.99/2.24 # Contextual simplify-reflections : 22
% 1.99/2.24 # Paramodulations : 33
% 1.99/2.24 # Factorizations : 0
% 1.99/2.24 # NegExts : 0
% 1.99/2.24 # Equation resolutions : 6
% 1.99/2.24 # Disequality decompositions : 0
% 1.99/2.24 # Total rewrite steps : 1
% 1.99/2.24 # ...of those cached : 0
% 1.99/2.24 # Propositional unsat checks : 0
% 1.99/2.24 # Propositional check models : 0
% 1.99/2.24 # Propositional check unsatisfiable : 0
% 1.99/2.24 # Propositional clauses : 0
% 1.99/2.24 # Propositional clauses after purity: 0
% 1.99/2.24 # Propositional unsat core size : 0
% 1.99/2.24 # Propositional preprocessing time : 0.000
% 1.99/2.24 # Propositional encoding time : 0.000
% 1.99/2.24 # Propositional solver time : 0.000
% 1.99/2.24 # Success case prop preproc time : 0.000
% 1.99/2.24 # Success case prop encoding time : 0.000
% 1.99/2.24 # Success case prop solver time : 0.000
% 1.99/2.24 # Current number of processed clauses : 26
% 1.99/2.24 # Positive orientable unit clauses : 19
% 1.99/2.24 # Positive unorientable unit clauses: 0
% 1.99/2.24 # Negative unit clauses : 1
% 1.99/2.24 # Non-unit-clauses : 6
% 1.99/2.24 # Current number of unprocessed clauses: 65
% 1.99/2.24 # ...number of literals in the above : 199
% 1.99/2.24 # Current number of archived formulas : 0
% 1.99/2.24 # Current number of archived clauses : 69
% 1.99/2.24 # Clause-clause subsumption calls (NU) : 505
% 1.99/2.24 # Rec. Clause-clause subsumption calls : 147
% 1.99/2.24 # Non-unit clause-clause subsumptions : 22
% 1.99/2.24 # Unit Clause-clause subsumption calls : 0
% 1.99/2.24 # Rewrite failures with RHS unbound : 0
% 1.99/2.24 # BW rewrite match attempts : 0
% 1.99/2.24 # BW rewrite match successes : 0
% 1.99/2.24 # Condensation attempts : 0
% 1.99/2.24 # Condensation successes : 0
% 1.99/2.24 # Termbank termtop insertions : 654291
% 1.99/2.24 # Search garbage collected termcells : 291766
% 1.99/2.24
% 1.99/2.24 # -------------------------------------------------
% 1.99/2.24 # User time : 0.233 s
% 1.99/2.24 # System time : 0.147 s
% 1.99/2.24 # Total time : 0.379 s
% 1.99/2.24 # Maximum resident set size: 131708 pages
% 1.99/2.24
% 1.99/2.24 # -------------------------------------------------
% 1.99/2.24 # User time : 1.532 s
% 1.99/2.24 # System time : 0.209 s
% 1.99/2.24 # Total time : 1.742 s
% 1.99/2.24 # Maximum resident set size: 57420 pages
% 1.99/2.24 % E---3.1 exiting
%------------------------------------------------------------------------------