TSTP Solution File: CSR082+2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR082+2 : TPTP v8.1.2. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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:17 EDT 2024
% Result : Theorem 25.37s 23.31s
% Output : CNFRefutation 25.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 37 ( 15 unt; 0 def)
% Number of atoms : 78 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 73 ( 32 ~; 28 |; 6 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 10 con; 0-0 aty)
% Number of variables : 38 ( 5 sgn 16 !; 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/tmp/tmp.YM2gbCLViA/E---3.1_6748.p',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/tmp/tmp.YM2gbCLViA/E---3.1_6748.p',kb_SUMO_26) ).
fof(kb_SUMO_15952_15708,axiom,
s__subclass(s__Human,s__SentientAgent),
file('/export/starexec/sandbox/tmp/tmp.YM2gbCLViA/E---3.1_6748.p',kb_SUMO_15952_15708) ).
fof(kb_SUMO_5956_5941,axiom,
s__subclass(s__SentientAgent,s__Object),
file('/export/starexec/sandbox/tmp/tmp.YM2gbCLViA/E---3.1_6748.p',kb_SUMO_5956_5941) ).
fof(local_1,axiom,
s__instance(s__Jane8_1,s__Human),
file('/export/starexec/sandbox/tmp/tmp.YM2gbCLViA/E---3.1_6748.p',local_1) ).
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/tmp/tmp.YM2gbCLViA/E---3.1_6748.p',kb_SUMO_6509) ).
fof(kb_SUMO_7281,axiom,
s__subclass(s__Human,s__CognitiveAgent),
file('/export/starexec/sandbox/tmp/tmp.YM2gbCLViA/E---3.1_6748.p',kb_SUMO_7281) ).
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/tmp/tmp.YM2gbCLViA/E---3.1_6748.p',prove_from_SUMO_MILO) ).
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/tmp/tmp.YM2gbCLViA/E---3.1_6748.p',kb_SUMO_6882) ).
fof(c_0_9,plain,
! [X1408,X1409,X1410] :
( ~ s__instance(X1409,s__SetOrClass)
| ~ s__instance(X1408,s__SetOrClass)
| ~ s__subclass(X1408,X1409)
| ~ s__instance(X1410,X1408)
| s__instance(X1410,X1409) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_27])])]) ).
fof(c_0_10,plain,
! [X1406,X1407] :
( ( s__instance(X1406,s__SetOrClass)
| ~ s__subclass(X1406,X1407) )
& ( s__instance(X1407,s__SetOrClass)
| ~ s__subclass(X1406,X1407) ) ),
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_11,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_9]) ).
cnf(c_0_12,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( s__instance(X1,X2)
| ~ s__subclass(X3,X2)
| ~ s__instance(X1,X3) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_15,plain,
s__subclass(s__Human,s__SentientAgent),
inference(split_conjunct,[status(thm)],[kb_SUMO_15952_15708]) ).
cnf(c_0_16,plain,
s__subclass(s__SentientAgent,s__Object),
inference(split_conjunct,[status(thm)],[kb_SUMO_5956_5941]) ).
cnf(c_0_17,plain,
( s__instance(X1,s__SentientAgent)
| ~ s__instance(X1,s__Human) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
s__instance(s__Jane8_1,s__Human),
inference(split_conjunct,[status(thm)],[local_1]) ).
fof(c_0_19,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_20,plain,
( s__instance(X1,s__Object)
| ~ s__instance(X1,s__SentientAgent) ),
inference(spm,[status(thm)],[c_0_14,c_0_16]) ).
cnf(c_0_21,plain,
s__instance(s__Jane8_1,s__SentientAgent),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
s__subclass(s__Human,s__CognitiveAgent),
inference(split_conjunct,[status(thm)],[kb_SUMO_7281]) ).
fof(c_0_23,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]) ).
cnf(c_0_24,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_19]) ).
cnf(c_0_25,plain,
s__instance(s__Jane8_1,s__Object),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
( s__instance(X1,s__CognitiveAgent)
| ~ s__instance(X1,s__Human) ),
inference(spm,[status(thm)],[c_0_14,c_0_22]) ).
fof(c_0_27,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_28,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_23])])]) ).
cnf(c_0_29,plain,
( s__capability(s__Reasoning,s__agent__m,s__Jane8_1)
| ~ s__instance(s__Jane8_1,s__CognitiveAgent) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
s__instance(s__Jane8_1,s__CognitiveAgent),
inference(spm,[status(thm)],[c_0_26,c_0_18]) ).
cnf(c_0_31,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_27]) ).
cnf(c_0_32,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_28]) ).
cnf(c_0_33,plain,
s__capability(s__Reasoning,s__agent__m,s__Jane8_1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]) ).
cnf(c_0_34,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_31,c_0_25]),c_0_21])]) ).
cnf(c_0_35,negated_conjecture,
~ s__capability(s__Perception,X1,s__Jane8_1),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,plain,
$false,
inference(sr,[status(thm)],[c_0_34,c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 9.28/9.32 % Problem : CSR082+2 : TPTP v8.1.2. Bugfixed v7.3.0.
% 9.28/9.33 % Command : run_E %s %d THM
% 9.32/9.54 % Computer : n013.cluster.edu
% 9.32/9.54 % Model : x86_64 x86_64
% 9.32/9.54 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 9.32/9.54 % Memory : 8042.1875MB
% 9.32/9.54 % OS : Linux 3.10.0-693.el7.x86_64
% 9.32/9.54 % CPULimit : 300
% 9.32/9.54 % WCLimit : 300
% 9.32/9.54 % DateTime : Fri May 3 14:21:32 EDT 2024
% 9.32/9.54 % CPUTime :
% 21.85/22.08 Running first-order theorem proving
% 21.85/22.08 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.YM2gbCLViA/E---3.1_6748.p
% 25.37/23.31 # Version: 3.1.0
% 25.37/23.31 # Preprocessing class: FMLLSMSLSSSNFFN.
% 25.37/23.31 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 25.37/23.31 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 25.37/23.31 # Starting new_bool_3 with 300s (1) cores
% 25.37/23.31 # Starting new_bool_1 with 300s (1) cores
% 25.37/23.31 # Starting sh5l with 300s (1) cores
% 25.37/23.31 # new_bool_3 with pid 6928 completed with status 0
% 25.37/23.31 # Result found by new_bool_3
% 25.37/23.31 # Preprocessing class: FMLLSMSLSSSNFFN.
% 25.37/23.31 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 25.37/23.31 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 25.37/23.31 # Starting new_bool_3 with 300s (1) cores
% 25.37/23.31 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 25.37/23.31 # Search class: FHHSS-FSLM31-MFFFFFNN
% 25.37/23.31 # partial match(2): FGHSM-FSLM31-MFFFFFNN
% 25.37/23.31 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 25.37/23.31 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 135s (1) cores
% 25.37/23.31 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 6931 completed with status 0
% 25.37/23.31 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 25.37/23.31 # Preprocessing class: FMLLSMSLSSSNFFN.
% 25.37/23.31 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 25.37/23.31 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 25.37/23.31 # Starting new_bool_3 with 300s (1) cores
% 25.37/23.31 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 25.37/23.31 # Search class: FHHSS-FSLM31-MFFFFFNN
% 25.37/23.31 # partial match(2): FGHSM-FSLM31-MFFFFFNN
% 25.37/23.31 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 25.37/23.31 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 135s (1) cores
% 25.37/23.31 # Preprocessing time : 0.015 s
% 25.37/23.31 # Presaturation interreduction done
% 25.37/23.31
% 25.37/23.31 # Proof found!
% 25.37/23.31 # SZS status Theorem
% 25.37/23.31 # SZS output start CNFRefutation
% See solution above
% 25.37/23.31 # Parsed axioms : 37983
% 25.37/23.31 # Removed by relevancy pruning/SinE : 37253
% 25.37/23.31 # Initial clauses : 791
% 25.37/23.31 # Removed in clause preprocessing : 4
% 25.37/23.31 # Initial clauses in saturation : 787
% 25.37/23.31 # Processed clauses : 3555
% 25.37/23.31 # ...of these trivial : 829
% 25.37/23.31 # ...subsumed : 5
% 25.37/23.31 # ...remaining for further processing : 2721
% 25.37/23.31 # Other redundant clauses eliminated : 1
% 25.37/23.31 # Clauses deleted for lack of memory : 0
% 25.37/23.31 # Backward-subsumed : 1
% 25.37/23.31 # Backward-rewritten : 2
% 25.37/23.31 # Generated clauses : 5332
% 25.37/23.31 # ...of the previous two non-redundant : 4477
% 25.37/23.31 # ...aggressively subsumed : 0
% 25.37/23.31 # Contextual simplify-reflections : 45
% 25.37/23.31 # Paramodulations : 5330
% 25.37/23.31 # Factorizations : 0
% 25.37/23.31 # NegExts : 0
% 25.37/23.31 # Equation resolutions : 1
% 25.37/23.31 # Disequality decompositions : 0
% 25.37/23.31 # Total rewrite steps : 2121
% 25.37/23.31 # ...of those cached : 1730
% 25.37/23.31 # Propositional unsat checks : 0
% 25.37/23.31 # Propositional check models : 0
% 25.37/23.31 # Propositional check unsatisfiable : 0
% 25.37/23.31 # Propositional clauses : 0
% 25.37/23.31 # Propositional clauses after purity: 0
% 25.37/23.31 # Propositional unsat core size : 0
% 25.37/23.31 # Propositional preprocessing time : 0.000
% 25.37/23.31 # Propositional encoding time : 0.000
% 25.37/23.31 # Propositional solver time : 0.000
% 25.37/23.31 # Success case prop preproc time : 0.000
% 25.37/23.31 # Success case prop encoding time : 0.000
% 25.37/23.31 # Success case prop solver time : 0.000
% 25.37/23.31 # Current number of processed clauses : 1950
% 25.37/23.31 # Positive orientable unit clauses : 927
% 25.37/23.31 # Positive unorientable unit clauses: 0
% 25.37/23.31 # Negative unit clauses : 1
% 25.37/23.31 # Non-unit-clauses : 1022
% 25.37/23.31 # Current number of unprocessed clauses: 2475
% 25.37/23.31 # ...number of literals in the above : 3098
% 25.37/23.31 # Current number of archived formulas : 0
% 25.37/23.31 # Current number of archived clauses : 770
% 25.37/23.31 # Clause-clause subsumption calls (NU) : 106406
% 25.37/23.31 # Rec. Clause-clause subsumption calls : 68947
% 25.37/23.31 # Non-unit clause-clause subsumptions : 50
% 25.37/23.31 # Unit Clause-clause subsumption calls : 2918
% 25.37/23.31 # Rewrite failures with RHS unbound : 0
% 25.37/23.31 # BW rewrite match attempts : 5
% 25.37/23.31 # BW rewrite match successes : 2
% 25.37/23.31 # Condensation attempts : 0
% 25.37/23.31 # Condensation successes : 0
% 25.37/23.31 # Termbank termtop insertions : 327448
% 25.37/23.31 # Search garbage collected termcells : 126761
% 25.37/23.31
% 25.37/23.31 # -------------------------------------------------
% 25.37/23.31 # User time : 0.337 s
% 25.37/23.31 # System time : 0.081 s
% 25.37/23.31 # Total time : 0.418 s
% 25.37/23.31 # Maximum resident set size: 50100 pages
% 25.37/23.31
% 25.37/23.31 # -------------------------------------------------
% 25.37/23.31 # User time : 1.062 s
% 25.37/23.31 # System time : 0.117 s
% 25.37/23.31 # Total time : 1.180 s
% 25.37/23.31 # Maximum resident set size: 28412 pages
% 25.37/23.31 % E---3.1 exiting
% 25.37/23.32 % E exiting
%------------------------------------------------------------------------------