TSTP Solution File: CSR083+2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : CSR083+2 : TPTP v8.2.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:15 EDT 2024
% Result : Theorem 1.30s 1.10s
% Output : CNFRefutation 1.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 9 ( 5 unt; 0 def)
% Number of atoms : 17 ( 4 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 15 ( 7 ~; 4 |; 4 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 4 ( 0 sgn 1 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_from_SUMO_MILO,conjecture,
? [X1223] :
( s__subclass(X1223,s__Animal)
& s__subclass(X1223,s__CognitiveAgent)
& X1223 = s__Human ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_from_SUMO_MILO) ).
fof(kb_SUMO_7281,axiom,
s__subclass(s__Human,s__CognitiveAgent),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+1.ax',kb_SUMO_7281) ).
fof(kb_SUMO_15950,axiom,
s__subclass(s__Human,s__Animal),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+4.ax',kb_SUMO_15950) ).
fof(c_0_3,negated_conjecture,
~ ? [X1223] :
( s__subclass(X1223,s__Animal)
& s__subclass(X1223,s__CognitiveAgent)
& X1223 = s__Human ),
inference(assume_negation,[status(cth)],[prove_from_SUMO_MILO]) ).
fof(c_0_4,negated_conjecture,
! [X1224] :
( ~ s__subclass(X1224,s__Animal)
| ~ s__subclass(X1224,s__CognitiveAgent)
| X1224 != s__Human ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
cnf(c_0_5,negated_conjecture,
( ~ s__subclass(X1,s__Animal)
| ~ s__subclass(X1,s__CognitiveAgent)
| X1 != s__Human ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_6,plain,
s__subclass(s__Human,s__CognitiveAgent),
inference(split_conjunct,[status(thm)],[kb_SUMO_7281]) ).
cnf(c_0_7,plain,
s__subclass(s__Human,s__Animal),
inference(split_conjunct,[status(thm)],[kb_SUMO_15950]) ).
cnf(c_0_8,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_5]),c_0_6]),c_0_7])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : CSR083+2 : TPTP v8.2.0. Bugfixed v7.3.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n029.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:31:53 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.18/0.44 Running first-order model finding
% 0.18/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.30/1.10 # Version: 3.1.0
% 1.30/1.10 # Preprocessing class: FMLLSMSLSSSNFFN.
% 1.30/1.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.30/1.10 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.30/1.10 # Starting new_bool_3 with 300s (1) cores
% 1.30/1.10 # Starting new_bool_1 with 300s (1) cores
% 1.30/1.10 # Starting sh5l with 300s (1) cores
% 1.30/1.10 # new_bool_3 with pid 1652 completed with status 0
% 1.30/1.10 # Result found by new_bool_3
% 1.30/1.10 # Preprocessing class: FMLLSMSLSSSNFFN.
% 1.30/1.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.30/1.10 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.30/1.10 # Starting new_bool_3 with 300s (1) cores
% 1.30/1.10 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.30/1.10 # Search class: FHHSF-FFMM00-SFFFFFNN
% 1.30/1.10 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.30/1.10 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 1.30/1.10 # SAT001_MinMin_p005000_rr_RG with pid 1662 completed with status 0
% 1.30/1.10 # Result found by SAT001_MinMin_p005000_rr_RG
% 1.30/1.10 # Preprocessing class: FMLLSMSLSSSNFFN.
% 1.30/1.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.30/1.10 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.30/1.10 # Starting new_bool_3 with 300s (1) cores
% 1.30/1.10 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.30/1.10 # Search class: FHHSF-FFMM00-SFFFFFNN
% 1.30/1.10 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.30/1.10 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 1.30/1.10 # Preprocessing time : 0.007 s
% 1.30/1.10 # Presaturation interreduction done
% 1.30/1.10
% 1.30/1.10 # Proof found!
% 1.30/1.10 # SZS status Theorem
% 1.30/1.10 # SZS output start CNFRefutation
% See solution above
% 1.30/1.10 # Parsed axioms : 37982
% 1.30/1.10 # Removed by relevancy pruning/SinE : 37906
% 1.30/1.10 # Initial clauses : 79
% 1.30/1.10 # Removed in clause preprocessing : 4
% 1.30/1.10 # Initial clauses in saturation : 75
% 1.30/1.10 # Processed clauses : 9
% 1.30/1.10 # ...of these trivial : 0
% 1.30/1.10 # ...subsumed : 0
% 1.30/1.10 # ...remaining for further processing : 9
% 1.30/1.10 # Other redundant clauses eliminated : 1
% 1.30/1.10 # Clauses deleted for lack of memory : 0
% 1.30/1.10 # Backward-subsumed : 0
% 1.30/1.10 # Backward-rewritten : 1
% 1.30/1.10 # Generated clauses : 1
% 1.30/1.10 # ...of the previous two non-redundant : 0
% 1.30/1.10 # ...aggressively subsumed : 0
% 1.30/1.10 # Contextual simplify-reflections : 0
% 1.30/1.10 # Paramodulations : 0
% 1.30/1.10 # Factorizations : 0
% 1.30/1.10 # NegExts : 0
% 1.30/1.10 # Equation resolutions : 1
% 1.30/1.10 # Disequality decompositions : 0
% 1.30/1.10 # Total rewrite steps : 3
% 1.30/1.10 # ...of those cached : 0
% 1.30/1.10 # Propositional unsat checks : 0
% 1.30/1.10 # Propositional check models : 0
% 1.30/1.10 # Propositional check unsatisfiable : 0
% 1.30/1.10 # Propositional clauses : 0
% 1.30/1.10 # Propositional clauses after purity: 0
% 1.30/1.10 # Propositional unsat core size : 0
% 1.30/1.10 # Propositional preprocessing time : 0.000
% 1.30/1.10 # Propositional encoding time : 0.000
% 1.30/1.10 # Propositional solver time : 0.000
% 1.30/1.10 # Success case prop preproc time : 0.000
% 1.30/1.10 # Success case prop encoding time : 0.000
% 1.30/1.10 # Success case prop solver time : 0.000
% 1.30/1.10 # Current number of processed clauses : 7
% 1.30/1.10 # Positive orientable unit clauses : 7
% 1.30/1.10 # Positive unorientable unit clauses: 0
% 1.30/1.10 # Negative unit clauses : 0
% 1.30/1.10 # Non-unit-clauses : 0
% 1.30/1.10 # Current number of unprocessed clauses: 66
% 1.30/1.10 # ...number of literals in the above : 82
% 1.30/1.10 # Current number of archived formulas : 0
% 1.30/1.10 # Current number of archived clauses : 1
% 1.30/1.10 # Clause-clause subsumption calls (NU) : 0
% 1.30/1.10 # Rec. Clause-clause subsumption calls : 0
% 1.30/1.10 # Non-unit clause-clause subsumptions : 0
% 1.30/1.10 # Unit Clause-clause subsumption calls : 0
% 1.30/1.10 # Rewrite failures with RHS unbound : 0
% 1.30/1.10 # BW rewrite match attempts : 1
% 1.30/1.10 # BW rewrite match successes : 1
% 1.30/1.10 # Condensation attempts : 0
% 1.30/1.10 # Condensation successes : 0
% 1.30/1.10 # Termbank termtop insertions : 249624
% 1.30/1.10 # Search garbage collected termcells : 125507
% 1.30/1.10
% 1.30/1.10 # -------------------------------------------------
% 1.30/1.10 # User time : 0.106 s
% 1.30/1.10 # System time : 0.030 s
% 1.30/1.10 # Total time : 0.136 s
% 1.30/1.10 # Maximum resident set size: 49252 pages
% 1.30/1.10
% 1.30/1.10 # -------------------------------------------------
% 1.30/1.10 # User time : 0.573 s
% 1.30/1.10 # System time : 0.047 s
% 1.30/1.10 # Total time : 0.620 s
% 1.30/1.10 # Maximum resident set size: 27828 pages
% 1.30/1.10 % E---3.1 exiting
%------------------------------------------------------------------------------