TSTP Solution File: CSR082+6 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : CSR082+6 : TPTP v8.2.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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:14 EDT 2024
% Result : Theorem 4.69s 3.16s
% Output : CNFRefutation 4.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 10
% Syntax : Number of formulae : 39 ( 17 unt; 0 def)
% Number of atoms : 80 ( 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 : 11 ( 11 usr; 11 con; 0-0 aty)
% Number of variables : 39 ( 5 sgn 16 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(kb_SUMO_26636,axiom,
! [X1,X15,X13] :
( ( s__instance(X15,s__SetOrClass)
& s__instance(X1,s__SetOrClass) )
=> ( ( s__subclass(X1,X15)
& s__instance(X13,X1) )
=> s__instance(X13,X15) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+2.ax',kb_SUMO_26636) ).
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(local_1,axiom,
s__instance(s__Jane8_1,s__Human),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_1) ).
fof(kb_SUMO_35206,axiom,
s__subclass(s__Human,s__CognitiveAgent),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+2.ax',kb_SUMO_35206) ).
fof(kb_SUMO_27597,axiom,
s__subclass(s__CognitiveAgent,s__SentientAgent),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+2.ax',kb_SUMO_27597) ).
fof(kb_SUMO_27595,axiom,
s__subclass(s__SentientAgent,s__Agent),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+2.ax',kb_SUMO_27595) ).
fof(prove_from_ALL,conjecture,
? [X2341,X2342] :
( s__capability(s__Reasoning,X2341,s__Jane8_1)
& s__capability(s__Perception,X2342,s__Jane8_1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_from_ALL) ).
fof(kb_SUMO_34434,axiom,
! [X20] :
( s__instance(X20,s__Object)
=> ( s__instance(X20,s__CognitiveAgent)
=> s__capability(s__Reasoning,s__agent__m,X20) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+2.ax',kb_SUMO_34434) ).
fof(kb_SUMO_27592,axiom,
s__subclass(s__Agent,s__Object),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+2.ax',kb_SUMO_27592) ).
fof(kb_SUMO_34807,axiom,
! [X20] :
( s__instance(X20,s__Object)
=> ( s__instance(X20,s__SentientAgent)
=> s__capability(s__Perception,s__experiencer__m,X20) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+2.ax',kb_SUMO_34807) ).
fof(c_0_10,plain,
! [X2356,X2357,X2358] :
( ~ s__instance(X2357,s__SetOrClass)
| ~ s__instance(X2356,s__SetOrClass)
| ~ s__subclass(X2356,X2357)
| ~ s__instance(X2358,X2356)
| s__instance(X2358,X2357) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26636])])]) ).
fof(c_0_11,plain,
! [X2354,X2355] :
( ( s__instance(X2354,s__SetOrClass)
| ~ s__subclass(X2354,X2355) )
& ( s__instance(X2355,s__SetOrClass)
| ~ s__subclass(X2354,X2355) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26635])])])]) ).
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__instance(X1,X3)
| ~ s__subclass(X3,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_16,plain,
s__instance(s__Jane8_1,s__Human),
inference(split_conjunct,[status(thm)],[local_1]) ).
cnf(c_0_17,plain,
( s__instance(s__Jane8_1,X1)
| ~ s__subclass(s__Human,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,plain,
s__subclass(s__Human,s__CognitiveAgent),
inference(split_conjunct,[status(thm)],[kb_SUMO_35206]) ).
cnf(c_0_19,plain,
s__instance(s__Jane8_1,s__CognitiveAgent),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,plain,
( s__instance(s__Jane8_1,X1)
| ~ s__subclass(s__CognitiveAgent,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_19]) ).
cnf(c_0_21,plain,
s__subclass(s__CognitiveAgent,s__SentientAgent),
inference(split_conjunct,[status(thm)],[kb_SUMO_27597]) ).
cnf(c_0_22,plain,
s__instance(s__Jane8_1,s__SentientAgent),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,plain,
( s__instance(s__Jane8_1,X1)
| ~ s__subclass(s__SentientAgent,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_22]) ).
cnf(c_0_24,plain,
s__subclass(s__SentientAgent,s__Agent),
inference(split_conjunct,[status(thm)],[kb_SUMO_27595]) ).
cnf(c_0_25,plain,
s__instance(s__Jane8_1,s__Agent),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
fof(c_0_26,negated_conjecture,
~ ? [X2341,X2342] :
( s__capability(s__Reasoning,X2341,s__Jane8_1)
& s__capability(s__Perception,X2342,s__Jane8_1) ),
inference(assume_negation,[status(cth)],[prove_from_ALL]) ).
fof(c_0_27,plain,
! [X2351] :
( ~ s__instance(X2351,s__Object)
| ~ s__instance(X2351,s__CognitiveAgent)
| s__capability(s__Reasoning,s__agent__m,X2351) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_34434])])]) ).
cnf(c_0_28,plain,
( s__instance(s__Jane8_1,X1)
| ~ s__subclass(s__Agent,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_25]) ).
cnf(c_0_29,plain,
s__subclass(s__Agent,s__Object),
inference(split_conjunct,[status(thm)],[kb_SUMO_27592]) ).
fof(c_0_30,negated_conjecture,
! [X2343,X2344] :
( ~ s__capability(s__Reasoning,X2343,s__Jane8_1)
| ~ s__capability(s__Perception,X2344,s__Jane8_1) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_26])])]) ).
cnf(c_0_31,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_32,plain,
s__instance(s__Jane8_1,s__Object),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
fof(c_0_33,plain,
! [X2347] :
( ~ s__instance(X2347,s__Object)
| ~ s__instance(X2347,s__SentientAgent)
| s__capability(s__Perception,s__experiencer__m,X2347) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_34807])])]) ).
cnf(c_0_34,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_35,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_31,c_0_32]),c_0_19])]) ).
cnf(c_0_36,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_33]) ).
cnf(c_0_37,negated_conjecture,
~ s__capability(s__Perception,X1,s__Jane8_1),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_32]),c_0_22])]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : CSR082+6 : TPTP v8.2.0. Bugfixed v7.3.0.
% 0.12/0.15 % Command : run_E %s %d THM
% 0.16/0.38 % Computer : n002.cluster.edu
% 0.16/0.38 % Model : x86_64 x86_64
% 0.16/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.38 % Memory : 8042.1875MB
% 0.16/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.38 % CPULimit : 300
% 0.16/0.38 % WCLimit : 300
% 0.16/0.38 % DateTime : Sun May 19 01:57:53 EDT 2024
% 0.16/0.38 % CPUTime :
% 0.25/0.50 Running first-order model finding
% 0.25/0.50 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
% 4.69/3.16 # Version: 3.1.0
% 4.69/3.16 # Preprocessing class: FMLLSMSLSSSNFFN.
% 4.69/3.16 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 4.69/3.16 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1495s (5) cores
% 4.69/3.16 # Starting new_bool_3 with 299s (1) cores
% 4.69/3.16 # Starting new_bool_1 with 299s (1) cores
% 4.69/3.16 # Starting sh5l with 299s (1) cores
% 4.69/3.16 # new_bool_1 with pid 30247 completed with status 0
% 4.69/3.16 # Result found by new_bool_1
% 4.69/3.16 # Preprocessing class: FMLLSMSLSSSNFFN.
% 4.69/3.16 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 4.69/3.16 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1495s (5) cores
% 4.69/3.16 # Starting new_bool_3 with 299s (1) cores
% 4.69/3.16 # Starting new_bool_1 with 299s (1) cores
% 4.69/3.16 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.69/3.16 # Search class: FGHSS-FSLM33-MFFFFFNN
% 4.69/3.16 # partial match(1): FGHSM-FSLM33-MFFFFFNN
% 4.69/3.16 # Scheduled 6 strats onto 1 cores with 299 seconds (299 total)
% 4.69/3.16 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 81s (1) cores
% 4.69/3.16 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with pid 30249 completed with status 0
% 4.69/3.16 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 4.69/3.16 # Preprocessing class: FMLLSMSLSSSNFFN.
% 4.69/3.16 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 4.69/3.16 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1495s (5) cores
% 4.69/3.16 # Starting new_bool_3 with 299s (1) cores
% 4.69/3.16 # Starting new_bool_1 with 299s (1) cores
% 4.69/3.16 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.69/3.16 # Search class: FGHSS-FSLM33-MFFFFFNN
% 4.69/3.16 # partial match(1): FGHSM-FSLM33-MFFFFFNN
% 4.69/3.16 # Scheduled 6 strats onto 1 cores with 299 seconds (299 total)
% 4.69/3.16 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 81s (1) cores
% 4.69/3.16 # Preprocessing time : 0.030 s
% 4.69/3.16 # Presaturation interreduction done
% 4.69/3.16
% 4.69/3.16 # Proof found!
% 4.69/3.16 # SZS status Theorem
% 4.69/3.16 # SZS output start CNFRefutation
% See solution above
% 4.69/3.16 # Parsed axioms : 55588
% 4.69/3.16 # Removed by relevancy pruning/SinE : 55373
% 4.69/3.16 # Initial clauses : 321
% 4.69/3.16 # Removed in clause preprocessing : 19
% 4.69/3.16 # Initial clauses in saturation : 302
% 4.69/3.16 # Processed clauses : 898
% 4.69/3.16 # ...of these trivial : 33
% 4.69/3.16 # ...subsumed : 6
% 4.69/3.16 # ...remaining for further processing : 858
% 4.69/3.16 # Other redundant clauses eliminated : 46
% 4.69/3.16 # Clauses deleted for lack of memory : 0
% 4.69/3.16 # Backward-subsumed : 1
% 4.69/3.16 # Backward-rewritten : 11
% 4.69/3.16 # Generated clauses : 1026
% 4.69/3.16 # ...of the previous two non-redundant : 894
% 4.69/3.16 # ...aggressively subsumed : 0
% 4.69/3.16 # Contextual simplify-reflections : 67
% 4.69/3.16 # Paramodulations : 980
% 4.69/3.16 # Factorizations : 0
% 4.69/3.16 # NegExts : 0
% 4.69/3.16 # Equation resolutions : 46
% 4.69/3.16 # Disequality decompositions : 0
% 4.69/3.16 # Total rewrite steps : 265
% 4.69/3.16 # ...of those cached : 167
% 4.69/3.16 # Propositional unsat checks : 0
% 4.69/3.16 # Propositional check models : 0
% 4.69/3.16 # Propositional check unsatisfiable : 0
% 4.69/3.16 # Propositional clauses : 0
% 4.69/3.16 # Propositional clauses after purity: 0
% 4.69/3.16 # Propositional unsat core size : 0
% 4.69/3.16 # Propositional preprocessing time : 0.000
% 4.69/3.16 # Propositional encoding time : 0.000
% 4.69/3.16 # Propositional solver time : 0.000
% 4.69/3.16 # Success case prop preproc time : 0.000
% 4.69/3.16 # Success case prop encoding time : 0.000
% 4.69/3.16 # Success case prop solver time : 0.000
% 4.69/3.16 # Current number of processed clauses : 504
% 4.69/3.16 # Positive orientable unit clauses : 201
% 4.69/3.16 # Positive unorientable unit clauses: 0
% 4.69/3.16 # Negative unit clauses : 3
% 4.69/3.16 # Non-unit-clauses : 300
% 4.69/3.16 # Current number of unprocessed clauses: 594
% 4.69/3.16 # ...number of literals in the above : 2231
% 4.69/3.16 # Current number of archived formulas : 0
% 4.69/3.16 # Current number of archived clauses : 308
% 4.69/3.16 # Clause-clause subsumption calls (NU) : 53545
% 4.69/3.16 # Rec. Clause-clause subsumption calls : 3738
% 4.69/3.16 # Non-unit clause-clause subsumptions : 73
% 4.69/3.16 # Unit Clause-clause subsumption calls : 1036
% 4.69/3.16 # Rewrite failures with RHS unbound : 0
% 4.69/3.16 # BW rewrite match attempts : 7
% 4.69/3.16 # BW rewrite match successes : 5
% 4.69/3.16 # Condensation attempts : 0
% 4.69/3.16 # Condensation successes : 0
% 4.69/3.16 # Termbank termtop insertions : 696799
% 4.69/3.16 # Search garbage collected termcells : 295664
% 4.69/3.16
% 4.69/3.16 # -------------------------------------------------
% 4.69/3.16 # User time : 0.374 s
% 4.69/3.16 # System time : 0.151 s
% 4.69/3.16 # Total time : 0.525 s
% 4.69/3.16 # Maximum resident set size: 131736 pages
% 4.69/3.16
% 4.69/3.16 # -------------------------------------------------
% 4.69/3.16 # User time : 2.308 s
% 4.69/3.16 # System time : 0.218 s
% 4.69/3.16 # Total time : 2.525 s
% 4.69/3.16 # Maximum resident set size: 57424 pages
% 4.69/3.16 % E---3.1 exiting
%------------------------------------------------------------------------------