TSTP Solution File: CSR082+5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR082+5 : TPTP v8.2.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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:15 EDT 2024
% Result : Theorem 1.33s 1.10s
% Output : CNFRefutation 1.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 12
% Syntax : Number of formulae : 46 ( 19 unt; 0 def)
% Number of atoms : 92 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 86 ( 40 ~; 31 |; 6 &)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 3 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 11 con; 0-0 aty)
% Number of variables : 42 ( 6 sgn 18 !; 4 ?)
% 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+1.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+1.ax',kb_SUMO_26) ).
fof(kb_SUMO_7281,axiom,
s__subclass(s__Human,s__CognitiveAgent),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+1.ax',kb_SUMO_7281) ).
fof(kb_SUMO_832,axiom,
s__subclass(s__CognitiveAgent,s__SentientAgent),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+1.ax',kb_SUMO_832) ).
fof(local_1,axiom,
s__instance(s__Jane8_1,s__Human),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_1) ).
fof(kb_SUMO_830,axiom,
s__subclass(s__SentientAgent,s__Agent),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+1.ax',kb_SUMO_830) ).
fof(kb_SUMO_827,axiom,
s__subclass(s__Agent,s__Object),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+1.ax',kb_SUMO_827) ).
fof(prove_from_SUMO_MILO,conjecture,
? [X1223,X1224] :
( s__capability(s__Reasoning,X1223,s__Jane8_1)
& s__capability(s__Perception,X1224,s__Jane8_1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_from_SUMO_MILO) ).
fof(kb_SUMO_6509,axiom,
! [X91] :
( s__instance(X91,s__Object)
=> ( s__instance(X91,s__CognitiveAgent)
=> s__capability(s__Reasoning,s__agent__m,X91) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+1.ax',kb_SUMO_6509) ).
fof(kb_SUMO_6882,axiom,
! [X91] :
( s__instance(X91,s__Object)
=> ( s__instance(X91,s__SentientAgent)
=> s__capability(s__Perception,s__experiencer__m,X91) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+1.ax',kb_SUMO_6882) ).
fof(c_0_10,plain,
! [X1238,X1239,X1240] :
( ~ s__instance(X1239,s__SetOrClass)
| ~ s__instance(X1238,s__SetOrClass)
| ~ s__subclass(X1238,X1239)
| ~ s__instance(X1240,X1238)
| s__instance(X1240,X1239) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_27])])]) ).
fof(c_0_11,plain,
! [X1236,X1237] :
( ( s__instance(X1236,s__SetOrClass)
| ~ s__subclass(X1236,X1237) )
& ( s__instance(X1237,s__SetOrClass)
| ~ s__subclass(X1236,X1237) ) ),
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_12,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_10]) ).
cnf(c_0_13,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
( s__instance(X1,X2)
| ~ s__subclass(X3,X2)
| ~ s__instance(X1,X3) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_16,plain,
s__subclass(s__Human,s__CognitiveAgent),
inference(split_conjunct,[status(thm)],[kb_SUMO_7281]) ).
cnf(c_0_17,plain,
s__subclass(s__CognitiveAgent,s__SentientAgent),
inference(split_conjunct,[status(thm)],[kb_SUMO_832]) ).
cnf(c_0_18,plain,
( s__instance(X1,s__CognitiveAgent)
| ~ s__instance(X1,s__Human) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
s__instance(s__Jane8_1,s__Human),
inference(split_conjunct,[status(thm)],[local_1]) ).
cnf(c_0_20,plain,
s__subclass(s__SentientAgent,s__Agent),
inference(split_conjunct,[status(thm)],[kb_SUMO_830]) ).
cnf(c_0_21,plain,
( s__instance(X1,s__SentientAgent)
| ~ s__instance(X1,s__CognitiveAgent) ),
inference(spm,[status(thm)],[c_0_15,c_0_17]) ).
cnf(c_0_22,plain,
s__instance(s__Jane8_1,s__CognitiveAgent),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
s__subclass(s__Agent,s__Object),
inference(split_conjunct,[status(thm)],[kb_SUMO_827]) ).
cnf(c_0_24,plain,
( s__instance(X1,s__Agent)
| ~ s__instance(X1,s__SentientAgent) ),
inference(spm,[status(thm)],[c_0_15,c_0_20]) ).
cnf(c_0_25,plain,
s__instance(s__Jane8_1,s__SentientAgent),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
fof(c_0_26,negated_conjecture,
~ ? [X1223,X1224] :
( s__capability(s__Reasoning,X1223,s__Jane8_1)
& s__capability(s__Perception,X1224,s__Jane8_1) ),
inference(assume_negation,[status(cth)],[prove_from_SUMO_MILO]) ).
fof(c_0_27,plain,
! [X1233] :
( ~ s__instance(X1233,s__Object)
| ~ s__instance(X1233,s__CognitiveAgent)
| s__capability(s__Reasoning,s__agent__m,X1233) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_6509])])]) ).
cnf(c_0_28,plain,
( s__instance(X1,s__Object)
| ~ s__instance(X1,s__Agent) ),
inference(spm,[status(thm)],[c_0_15,c_0_23]) ).
cnf(c_0_29,plain,
s__instance(s__Jane8_1,s__Agent),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
fof(c_0_30,negated_conjecture,
! [X1225,X1226] :
( ~ s__capability(s__Reasoning,X1225,s__Jane8_1)
| ~ s__capability(s__Perception,X1226,s__Jane8_1) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_26])])]) ).
fof(c_0_31,plain,
( ~ epred1_0
<=> ! [X1] : ~ s__capability(s__Reasoning,X1,s__Jane8_1) ),
introduced(definition) ).
cnf(c_0_32,plain,
( s__capability(s__Reasoning,s__agent__m,X1)
| ~ s__instance(X1,s__Object)
| ~ s__instance(X1,s__CognitiveAgent) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_33,plain,
s__instance(s__Jane8_1,s__Object),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
fof(c_0_34,plain,
! [X1229] :
( ~ s__instance(X1229,s__Object)
| ~ s__instance(X1229,s__SentientAgent)
| s__capability(s__Perception,s__experiencer__m,X1229) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_6882])])]) ).
fof(c_0_35,plain,
( ~ epred2_0
<=> ! [X2] : ~ s__capability(s__Perception,X2,s__Jane8_1) ),
introduced(definition) ).
cnf(c_0_36,negated_conjecture,
( ~ s__capability(s__Reasoning,X1,s__Jane8_1)
| ~ s__capability(s__Perception,X2,s__Jane8_1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_37,negated_conjecture,
( epred1_0
| ~ s__capability(s__Reasoning,X1,s__Jane8_1) ),
inference(split_equiv,[status(thm)],[c_0_31]) ).
cnf(c_0_38,plain,
s__capability(s__Reasoning,s__agent__m,s__Jane8_1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_22])]) ).
cnf(c_0_39,plain,
( s__capability(s__Perception,s__experiencer__m,X1)
| ~ s__instance(X1,s__Object)
| ~ s__instance(X1,s__SentientAgent) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_40,negated_conjecture,
( ~ epred2_0
| ~ epred1_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_36,c_0_31]),c_0_35]) ).
cnf(c_0_41,negated_conjecture,
epred1_0,
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,negated_conjecture,
( epred2_0
| ~ s__capability(s__Perception,X1,s__Jane8_1) ),
inference(split_equiv,[status(thm)],[c_0_35]) ).
cnf(c_0_43,plain,
s__capability(s__Perception,s__experiencer__m,s__Jane8_1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_33]),c_0_25])]) ).
cnf(c_0_44,negated_conjecture,
~ epred2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : CSR082+5 : TPTP v8.2.0. Bugfixed v7.3.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 02:07:08 EDT 2024
% 0.20/0.34 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 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
% 1.33/1.10 # Version: 3.1.0
% 1.33/1.10 # Preprocessing class: FMLLSMSLSSSNFFN.
% 1.33/1.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.33/1.10 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.33/1.10 # Starting new_bool_3 with 300s (1) cores
% 1.33/1.10 # Starting new_bool_1 with 300s (1) cores
% 1.33/1.10 # Starting sh5l with 300s (1) cores
% 1.33/1.10 # new_bool_3 with pid 26476 completed with status 0
% 1.33/1.10 # Result found by new_bool_3
% 1.33/1.10 # Preprocessing class: FMLLSMSLSSSNFFN.
% 1.33/1.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.33/1.10 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.33/1.10 # Starting new_bool_3 with 300s (1) cores
% 1.33/1.10 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.33/1.10 # Search class: FHHSF-FSLM31-MFFFFFNN
% 1.33/1.10 # partial match(1): FGHSF-FSLM31-MFFFFFNN
% 1.33/1.10 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.33/1.10 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 163s (1) cores
% 1.33/1.10 # G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with pid 26479 completed with status 0
% 1.33/1.10 # Result found by G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S
% 1.33/1.10 # Preprocessing class: FMLLSMSLSSSNFFN.
% 1.33/1.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.33/1.10 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.33/1.10 # Starting new_bool_3 with 300s (1) cores
% 1.33/1.10 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.33/1.10 # Search class: FHHSF-FSLM31-MFFFFFNN
% 1.33/1.10 # partial match(1): FGHSF-FSLM31-MFFFFFNN
% 1.33/1.10 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.33/1.10 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 163s (1) cores
% 1.33/1.10 # Preprocessing time : 0.012 s
% 1.33/1.10 # Presaturation interreduction done
% 1.33/1.10
% 1.33/1.10 # Proof found!
% 1.33/1.10 # SZS status Theorem
% 1.33/1.10 # SZS output start CNFRefutation
% See solution above
% 1.33/1.10 # Parsed axioms : 16750
% 1.33/1.10 # Removed by relevancy pruning/SinE : 16588
% 1.33/1.10 # Initial clauses : 193
% 1.33/1.10 # Removed in clause preprocessing : 4
% 1.33/1.10 # Initial clauses in saturation : 189
% 1.33/1.10 # Processed clauses : 517
% 1.33/1.10 # ...of these trivial : 23
% 1.33/1.10 # ...subsumed : 3
% 1.33/1.10 # ...remaining for further processing : 491
% 1.33/1.10 # Other redundant clauses eliminated : 1
% 1.33/1.10 # Clauses deleted for lack of memory : 0
% 1.33/1.10 # Backward-subsumed : 0
% 1.33/1.10 # Backward-rewritten : 2
% 1.33/1.10 # Generated clauses : 646
% 1.33/1.10 # ...of the previous two non-redundant : 515
% 1.33/1.10 # ...aggressively subsumed : 0
% 1.33/1.10 # Contextual simplify-reflections : 48
% 1.33/1.10 # Paramodulations : 642
% 1.33/1.10 # Factorizations : 0
% 1.33/1.10 # NegExts : 0
% 1.33/1.10 # Equation resolutions : 1
% 1.33/1.10 # Disequality decompositions : 0
% 1.33/1.10 # Total rewrite steps : 113
% 1.33/1.10 # ...of those cached : 55
% 1.33/1.10 # Propositional unsat checks : 0
% 1.33/1.10 # Propositional check models : 0
% 1.33/1.10 # Propositional check unsatisfiable : 0
% 1.33/1.10 # Propositional clauses : 0
% 1.33/1.10 # Propositional clauses after purity: 0
% 1.33/1.10 # Propositional unsat core size : 0
% 1.33/1.10 # Propositional preprocessing time : 0.000
% 1.33/1.10 # Propositional encoding time : 0.000
% 1.33/1.10 # Propositional solver time : 0.000
% 1.33/1.10 # Success case prop preproc time : 0.000
% 1.33/1.10 # Success case prop encoding time : 0.000
% 1.33/1.10 # Success case prop solver time : 0.000
% 1.33/1.10 # Current number of processed clauses : 299
% 1.33/1.10 # Positive orientable unit clauses : 136
% 1.33/1.10 # Positive unorientable unit clauses: 0
% 1.33/1.10 # Negative unit clauses : 1
% 1.33/1.10 # Non-unit-clauses : 162
% 1.33/1.10 # Current number of unprocessed clauses: 375
% 1.33/1.10 # ...number of literals in the above : 653
% 1.33/1.10 # Current number of archived formulas : 0
% 1.33/1.10 # Current number of archived clauses : 190
% 1.33/1.10 # Clause-clause subsumption calls (NU) : 5953
% 1.33/1.10 # Rec. Clause-clause subsumption calls : 1130
% 1.33/1.10 # Non-unit clause-clause subsumptions : 51
% 1.33/1.10 # Unit Clause-clause subsumption calls : 1832
% 1.33/1.10 # Rewrite failures with RHS unbound : 0
% 1.33/1.10 # BW rewrite match attempts : 4
% 1.33/1.10 # BW rewrite match successes : 1
% 1.33/1.10 # Condensation attempts : 0
% 1.33/1.10 # Condensation successes : 0
% 1.33/1.10 # Termbank termtop insertions : 186614
% 1.33/1.10 # Search garbage collected termcells : 89008
% 1.33/1.10
% 1.33/1.10 # -------------------------------------------------
% 1.33/1.10 # User time : 0.103 s
% 1.33/1.10 # System time : 0.059 s
% 1.33/1.10 # Total time : 0.161 s
% 1.33/1.10 # Maximum resident set size: 39720 pages
% 1.33/1.10
% 1.33/1.10 # -------------------------------------------------
% 1.33/1.10 # User time : 0.518 s
% 1.33/1.10 # System time : 0.078 s
% 1.33/1.10 # Total time : 0.596 s
% 1.33/1.10 # Maximum resident set size: 18404 pages
% 1.33/1.10 % E---3.1 exiting
% 1.33/1.10 % E exiting
%------------------------------------------------------------------------------