TSTP Solution File: CSR118+4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR118+4 : TPTP v8.2.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:16:29 EDT 2024
% Result : Theorem 2.92s 1.34s
% Output : CNFRefutation 2.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of formulae : 24 ( 13 unt; 0 def)
% Number of atoms : 48 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 44 ( 20 ~; 17 |; 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 : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 23 ( 2 sgn 10 !; 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+0.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+0.ax',kb_SUMO_26) ).
fof(abe_mammal,conjecture,
s__instance(s__AbrahamLincoln,s__Mammal),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',abe_mammal) ).
fof(kb_SUMO_6086,axiom,
s__subclass(s__Human,s__Hominid),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_6086) ).
fof(kb_SUMO_6083,axiom,
s__subclass(s__Hominid,s__Primate),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_6083) ).
fof(kb_SUMO_6073,axiom,
s__subclass(s__Primate,s__Mammal),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_6073) ).
fof(abe_human,axiom,
s__instance(s__AbrahamLincoln,s__Human),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',abe_human) ).
fof(c_0_7,plain,
! [X593,X594,X595] :
( ~ s__instance(X594,s__SetOrClass)
| ~ s__instance(X593,s__SetOrClass)
| ~ s__subclass(X593,X594)
| ~ s__instance(X595,X593)
| s__instance(X595,X594) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_27])])]) ).
fof(c_0_8,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])])])]) ).
cnf(c_0_9,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_7]) ).
cnf(c_0_10,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,negated_conjecture,
~ s__instance(s__AbrahamLincoln,s__Mammal),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[abe_mammal])]) ).
cnf(c_0_13,plain,
( s__instance(X1,X2)
| ~ s__subclass(X3,X2)
| ~ s__instance(X1,X3) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_14,plain,
s__subclass(s__Human,s__Hominid),
inference(split_conjunct,[status(thm)],[kb_SUMO_6086]) ).
cnf(c_0_15,plain,
s__subclass(s__Hominid,s__Primate),
inference(split_conjunct,[status(thm)],[kb_SUMO_6083]) ).
cnf(c_0_16,plain,
s__subclass(s__Primate,s__Mammal),
inference(split_conjunct,[status(thm)],[kb_SUMO_6073]) ).
fof(c_0_17,negated_conjecture,
~ s__instance(s__AbrahamLincoln,s__Mammal),
inference(fof_nnf,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( s__instance(X1,s__Hominid)
| ~ s__instance(X1,s__Human) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
( s__instance(X1,s__Primate)
| ~ s__instance(X1,s__Hominid) ),
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
cnf(c_0_20,plain,
( s__instance(X1,s__Mammal)
| ~ s__instance(X1,s__Primate) ),
inference(spm,[status(thm)],[c_0_13,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
~ s__instance(s__AbrahamLincoln,s__Mammal),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,plain,
s__instance(s__AbrahamLincoln,s__Human),
inference(split_conjunct,[status(thm)],[abe_human]) ).
cnf(c_0_23,plain,
$false,
inference(cdclpropres,[status(thm)],[c_0_18,c_0_19,c_0_20,c_0_21,c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : CSR118+4 : TPTP v8.2.0. Bugfixed v7.3.0.
% 0.04/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n022.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sun May 19 02:32:22 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 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
% 2.92/1.34 # Version: 3.1.0
% 2.92/1.34 # Preprocessing class: FMLLSMSLSSSNFFN.
% 2.92/1.34 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.92/1.34 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.92/1.34 # Starting new_bool_3 with 300s (1) cores
% 2.92/1.34 # Starting new_bool_1 with 300s (1) cores
% 2.92/1.34 # Starting sh5l with 300s (1) cores
% 2.92/1.34 # sh5l with pid 12640 completed with status 0
% 2.92/1.34 # Result found by sh5l
% 2.92/1.34 # Preprocessing class: FMLLSMSLSSSNFFN.
% 2.92/1.34 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.92/1.34 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.92/1.34 # Starting new_bool_3 with 300s (1) cores
% 2.92/1.34 # Starting new_bool_1 with 300s (1) cores
% 2.92/1.34 # Starting sh5l with 300s (1) cores
% 2.92/1.34 # SinE strategy is gf500_gu_R04_F100_L20000
% 2.92/1.34 # Search class: FGHSM-SMLM31-MFFFFFNN
% 2.92/1.34 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.92/1.34 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 181s (1) cores
% 2.92/1.34 # C07_19_nc_SAT001_MinMin_p005000_rr with pid 12647 completed with status 0
% 2.92/1.34 # Result found by C07_19_nc_SAT001_MinMin_p005000_rr
% 2.92/1.34 # Preprocessing class: FMLLSMSLSSSNFFN.
% 2.92/1.34 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.92/1.34 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.92/1.34 # Starting new_bool_3 with 300s (1) cores
% 2.92/1.34 # Starting new_bool_1 with 300s (1) cores
% 2.92/1.34 # Starting sh5l with 300s (1) cores
% 2.92/1.34 # SinE strategy is gf500_gu_R04_F100_L20000
% 2.92/1.34 # Search class: FGHSM-SMLM31-MFFFFFNN
% 2.92/1.34 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.92/1.34 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 181s (1) cores
% 2.92/1.34 # Preprocessing time : 0.034 s
% 2.92/1.34 # Presaturation interreduction done
% 2.92/1.34 # SatCheck found unsatisfiable ground set
% 2.92/1.34
% 2.92/1.34 # Proof found!
% 2.92/1.34 # SZS status Theorem
% 2.92/1.34 # SZS output start CNFRefutation
% See solution above
% 2.92/1.34 # Parsed axioms : 7219
% 2.92/1.34 # Removed by relevancy pruning/SinE : 5430
% 2.92/1.34 # Initial clauses : 2217
% 2.92/1.34 # Removed in clause preprocessing : 58
% 2.92/1.34 # Initial clauses in saturation : 2159
% 2.92/1.34 # Processed clauses : 5432
% 2.92/1.34 # ...of these trivial : 342
% 2.92/1.34 # ...subsumed : 90
% 2.92/1.34 # ...remaining for further processing : 5000
% 2.92/1.34 # Other redundant clauses eliminated : 66
% 2.92/1.34 # Clauses deleted for lack of memory : 0
% 2.92/1.34 # Backward-subsumed : 4
% 2.92/1.34 # Backward-rewritten : 710
% 2.92/1.34 # Generated clauses : 7480
% 2.92/1.34 # ...of the previous two non-redundant : 6493
% 2.92/1.34 # ...aggressively subsumed : 0
% 2.92/1.34 # Contextual simplify-reflections : 172
% 2.92/1.34 # Paramodulations : 7419
% 2.92/1.34 # Factorizations : 2
% 2.92/1.34 # NegExts : 0
% 2.92/1.34 # Equation resolutions : 66
% 2.92/1.34 # Disequality decompositions : 0
% 2.92/1.34 # Total rewrite steps : 2090
% 2.92/1.34 # ...of those cached : 1086
% 2.92/1.34 # Propositional unsat checks : 1
% 2.92/1.34 # Propositional check models : 0
% 2.92/1.34 # Propositional check unsatisfiable : 1
% 2.92/1.34 # Propositional clauses : 6922
% 2.92/1.34 # Propositional clauses after purity: 373
% 2.92/1.34 # Propositional unsat core size : 5
% 2.92/1.34 # Propositional preprocessing time : 0.000
% 2.92/1.34 # Propositional encoding time : 0.008
% 2.92/1.34 # Propositional solver time : 0.001
% 2.92/1.34 # Success case prop preproc time : 0.000
% 2.92/1.34 # Success case prop encoding time : 0.008
% 2.92/1.34 # Success case prop solver time : 0.001
% 2.92/1.34 # Current number of processed clauses : 2137
% 2.92/1.34 # Positive orientable unit clauses : 926
% 2.92/1.34 # Positive unorientable unit clauses: 12
% 2.92/1.34 # Negative unit clauses : 2
% 2.92/1.34 # Non-unit-clauses : 1197
% 2.92/1.34 # Current number of unprocessed clauses: 4785
% 2.92/1.34 # ...number of literals in the above : 12547
% 2.92/1.34 # Current number of archived formulas : 0
% 2.92/1.34 # Current number of archived clauses : 2822
% 2.92/1.34 # Clause-clause subsumption calls (NU) : 690091
% 2.92/1.34 # Rec. Clause-clause subsumption calls : 177601
% 2.92/1.34 # Non-unit clause-clause subsumptions : 261
% 2.92/1.34 # Unit Clause-clause subsumption calls : 46632
% 2.92/1.34 # Rewrite failures with RHS unbound : 24
% 2.92/1.34 # BW rewrite match attempts : 1148
% 2.92/1.34 # BW rewrite match successes : 611
% 2.92/1.34 # Condensation attempts : 0
% 2.92/1.34 # Condensation successes : 0
% 2.92/1.34 # Termbank termtop insertions : 337635
% 2.92/1.34 # Search garbage collected termcells : 59552
% 2.92/1.34
% 2.92/1.34 # -------------------------------------------------
% 2.92/1.34 # User time : 0.607 s
% 2.92/1.34 # System time : 0.058 s
% 2.92/1.34 # Total time : 0.665 s
% 2.92/1.34 # Maximum resident set size: 21184 pages
% 2.92/1.34
% 2.92/1.34 # -------------------------------------------------
% 2.92/1.34 # User time : 0.761 s
% 2.92/1.34 # System time : 0.073 s
% 2.92/1.34 # Total time : 0.834 s
% 2.92/1.34 # Maximum resident set size: 9056 pages
% 2.92/1.34 % E---3.1 exiting
% 2.92/1.34 % E exiting
%------------------------------------------------------------------------------