TSTP Solution File: CSR101+6 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR101+6 : TPTP v8.1.2. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:34 EDT 2024
% Result : Theorem 65.35s 64.15s
% Output : CNFRefutation 65.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 21 ( 7 unt; 0 def)
% Number of atoms : 48 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 47 ( 20 ~; 17 |; 5 &)
% ( 0 <=>; 5 =>; 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 : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 25 ( 2 sgn 12 !; 0 ?)
% 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/tmp/tmp.GzbIbkfsIW/E---3.1_28206.p',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/tmp/tmp.GzbIbkfsIW/E---3.1_28206.p',kb_SUMO_26635) ).
fof(local_9,axiom,
s__subclass(s__Class32_3,s__Class32_1),
file('/export/starexec/sandbox2/tmp/tmp.GzbIbkfsIW/E---3.1_28206.p',local_9) ).
fof(local_8,axiom,
s__subclass(s__Class32_2,s__Class32_3),
file('/export/starexec/sandbox2/tmp/tmp.GzbIbkfsIW/E---3.1_28206.p',local_8) ).
fof(prove_from_ALL,conjecture,
! [X2341] :
( s__instance(X2341,s__Class32_2)
=> s__instance(X2341,s__Class32_1) ),
file('/export/starexec/sandbox2/tmp/tmp.GzbIbkfsIW/E---3.1_28206.p',prove_from_ALL) ).
fof(c_0_5,plain,
! [X2345,X2346,X2347] :
( ~ s__instance(X2346,s__SetOrClass)
| ~ s__instance(X2345,s__SetOrClass)
| ~ s__subclass(X2345,X2346)
| ~ s__instance(X2347,X2345)
| s__instance(X2347,X2346) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26636])])]) ).
fof(c_0_6,plain,
! [X2343,X2344] :
( ( s__instance(X2343,s__SetOrClass)
| ~ s__subclass(X2343,X2344) )
& ( s__instance(X2344,s__SetOrClass)
| ~ s__subclass(X2343,X2344) ) ),
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_7,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_5]) ).
cnf(c_0_8,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( s__instance(X1,X2)
| ~ s__instance(X1,X3)
| ~ s__subclass(X3,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).
cnf(c_0_11,plain,
s__subclass(s__Class32_3,s__Class32_1),
inference(split_conjunct,[status(thm)],[local_9]) ).
cnf(c_0_12,plain,
s__subclass(s__Class32_2,s__Class32_3),
inference(split_conjunct,[status(thm)],[local_8]) ).
fof(c_0_13,negated_conjecture,
~ ! [X2341] :
( s__instance(X2341,s__Class32_2)
=> s__instance(X2341,s__Class32_1) ),
inference(assume_negation,[status(cth)],[prove_from_ALL]) ).
cnf(c_0_14,plain,
( s__instance(X1,s__Class32_1)
| ~ s__instance(X1,s__Class32_3) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( s__instance(X1,s__Class32_3)
| ~ s__instance(X1,s__Class32_2) ),
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
fof(c_0_16,negated_conjecture,
( s__instance(esk1_0,s__Class32_2)
& ~ s__instance(esk1_0,s__Class32_1) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])]) ).
cnf(c_0_17,plain,
( s__instance(X1,s__Class32_1)
| ~ s__instance(X1,s__Class32_2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
s__instance(esk1_0,s__Class32_2),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,negated_conjecture,
~ s__instance(esk1_0,s__Class32_1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 33.20/33.30 % Problem : CSR101+6 : TPTP v8.1.2. Bugfixed v7.3.0.
% 33.20/33.31 % Command : run_E %s %d THM
% 33.31/33.50 % Computer : n017.cluster.edu
% 33.31/33.50 % Model : x86_64 x86_64
% 33.31/33.50 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 33.31/33.50 % Memory : 8042.1875MB
% 33.31/33.50 % OS : Linux 3.10.0-693.el7.x86_64
% 33.31/33.50 % CPULimit : 300
% 33.31/33.50 % WCLimit : 300
% 33.31/33.50 % DateTime : Fri May 3 14:22:11 EDT 2024
% 33.31/33.50 % CPUTime :
% 61.54/61.75 Running first-order theorem proving
% 61.54/61.75 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.GzbIbkfsIW/E---3.1_28206.p
% 65.35/64.15 # Version: 3.1.0
% 65.35/64.15 # Preprocessing class: FMLLSMSLSSSNFFN.
% 65.35/64.15 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 65.35/64.15 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1495s (5) cores
% 65.35/64.15 # Starting new_bool_3 with 299s (1) cores
% 65.35/64.15 # Starting new_bool_1 with 299s (1) cores
% 65.35/64.15 # Starting sh5l with 299s (1) cores
% 65.35/64.15 # new_bool_1 with pid 29166 completed with status 0
% 65.35/64.15 # Result found by new_bool_1
% 65.35/64.15 # Preprocessing class: FMLLSMSLSSSNFFN.
% 65.35/64.15 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 65.35/64.15 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1495s (5) cores
% 65.35/64.15 # Starting new_bool_3 with 299s (1) cores
% 65.35/64.15 # Starting new_bool_1 with 299s (1) cores
% 65.35/64.15 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 65.35/64.15 # Search class: FHUSF-FFSM00-SFFFFFNN
% 65.35/64.15 # partial match(1): FHUNF-FFSM00-SFFFFFNN
% 65.35/64.15 # Scheduled 5 strats onto 1 cores with 299 seconds (299 total)
% 65.35/64.15 # Starting SAT001_MinMin_p005000_rr_RG with 180s (1) cores
% 65.35/64.15 # SAT001_MinMin_p005000_rr_RG with pid 29176 completed with status 0
% 65.35/64.15 # Result found by SAT001_MinMin_p005000_rr_RG
% 65.35/64.15 # Preprocessing class: FMLLSMSLSSSNFFN.
% 65.35/64.15 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 65.35/64.15 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1495s (5) cores
% 65.35/64.15 # Starting new_bool_3 with 299s (1) cores
% 65.35/64.15 # Starting new_bool_1 with 299s (1) cores
% 65.35/64.15 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 65.35/64.15 # Search class: FHUSF-FFSM00-SFFFFFNN
% 65.35/64.15 # partial match(1): FHUNF-FFSM00-SFFFFFNN
% 65.35/64.15 # Scheduled 5 strats onto 1 cores with 299 seconds (299 total)
% 65.35/64.15 # Starting SAT001_MinMin_p005000_rr_RG with 180s (1) cores
% 65.35/64.15 # Preprocessing time : 0.056 s
% 65.35/64.15 # Presaturation interreduction done
% 65.35/64.15
% 65.35/64.15 # Proof found!
% 65.35/64.15 # SZS status Theorem
% 65.35/64.15 # SZS output start CNFRefutation
% See solution above
% 65.35/64.15 # Parsed axioms : 55596
% 65.35/64.15 # Removed by relevancy pruning/SinE : 55576
% 65.35/64.15 # Initial clauses : 24
% 65.35/64.15 # Removed in clause preprocessing : 4
% 65.35/64.15 # Initial clauses in saturation : 20
% 65.35/64.15 # Processed clauses : 71
% 65.35/64.15 # ...of these trivial : 5
% 65.35/64.15 # ...subsumed : 0
% 65.35/64.15 # ...remaining for further processing : 66
% 65.35/64.15 # Other redundant clauses eliminated : 0
% 65.35/64.15 # Clauses deleted for lack of memory : 0
% 65.35/64.15 # Backward-subsumed : 0
% 65.35/64.15 # Backward-rewritten : 0
% 65.35/64.15 # Generated clauses : 65
% 65.35/64.15 # ...of the previous two non-redundant : 40
% 65.35/64.15 # ...aggressively subsumed : 0
% 65.35/64.15 # Contextual simplify-reflections : 7
% 65.35/64.15 # Paramodulations : 65
% 65.35/64.15 # Factorizations : 0
% 65.35/64.16 # NegExts : 0
% 65.35/64.16 # Equation resolutions : 0
% 65.35/64.16 # Disequality decompositions : 0
% 65.35/64.16 # Total rewrite steps : 22
% 65.35/64.16 # ...of those cached : 15
% 65.35/64.16 # Propositional unsat checks : 0
% 65.35/64.16 # Propositional check models : 0
% 65.35/64.16 # Propositional check unsatisfiable : 0
% 65.35/64.16 # Propositional clauses : 0
% 65.35/64.16 # Propositional clauses after purity: 0
% 65.35/64.16 # Propositional unsat core size : 0
% 65.35/64.16 # Propositional preprocessing time : 0.000
% 65.35/64.16 # Propositional encoding time : 0.000
% 65.35/64.16 # Propositional solver time : 0.000
% 65.35/64.16 # Success case prop preproc time : 0.000
% 65.35/64.16 # Success case prop encoding time : 0.000
% 65.35/64.16 # Success case prop solver time : 0.000
% 65.35/64.16 # Current number of processed clauses : 46
% 65.35/64.16 # Positive orientable unit clauses : 27
% 65.35/64.16 # Positive unorientable unit clauses: 0
% 65.35/64.16 # Negative unit clauses : 1
% 65.35/64.16 # Non-unit-clauses : 18
% 65.35/64.16 # Current number of unprocessed clauses: 9
% 65.35/64.16 # ...number of literals in the above : 17
% 65.35/64.16 # Current number of archived formulas : 0
% 65.35/64.16 # Current number of archived clauses : 20
% 65.35/64.16 # Clause-clause subsumption calls (NU) : 30
% 65.35/64.16 # Rec. Clause-clause subsumption calls : 19
% 65.35/64.16 # Non-unit clause-clause subsumptions : 7
% 65.35/64.16 # Unit Clause-clause subsumption calls : 0
% 65.35/64.16 # Rewrite failures with RHS unbound : 0
% 65.35/64.16 # BW rewrite match attempts : 0
% 65.35/64.16 # BW rewrite match successes : 0
% 65.35/64.16 # Condensation attempts : 0
% 65.35/64.16 # Condensation successes : 0
% 65.35/64.16 # Termbank termtop insertions : 649724
% 65.35/64.16 # Search garbage collected termcells : 291036
% 65.35/64.16
% 65.35/64.16 # -------------------------------------------------
% 65.35/64.16 # User time : 0.230 s
% 65.35/64.16 # System time : 0.142 s
% 65.35/64.16 # Total time : 0.373 s
% 65.35/64.16 # Maximum resident set size: 132580 pages
% 65.35/64.16
% 65.35/64.16 # -------------------------------------------------
% 65.35/64.16 # User time : 2.098 s
% 65.35/64.16 # System time : 0.221 s
% 65.35/64.16 # Total time : 2.319 s
% 65.35/64.16 # Maximum resident set size: 58288 pages
% 65.35/64.16 % E---3.1 exiting
% 65.35/64.16 % E exiting
%------------------------------------------------------------------------------