TSTP Solution File: CSR100+6 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR100+6 : TPTP v8.1.2. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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:33 EDT 2024
% Result : Theorem 68.44s 66.99s
% Output : CNFRefutation 68.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 29 ( 15 unt; 0 def)
% Number of atoms : 69 ( 6 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 71 ( 31 ~; 28 |; 7 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 29 ( 2 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(kb_SUMO_28461,axiom,
! [X1034,X1035,X1097] :
( ( s__instance(X1097,s__SetOrClass)
& s__instance(X1035,s__SetOrClass)
& s__instance(X1034,s__SetOrClass) )
=> ( ( s__subclass(X1034,X1035)
& s__subclass(X1035,X1097) )
=> s__subclass(X1034,X1097) ) ),
file('/export/starexec/sandbox/tmp/tmp.L3IA7ZspyT/E---3.1_31971.p',kb_SUMO_28461) ).
fof(kb_SUMO_26635,axiom,
! [X1,X15] :
( s__subclass(X1,X15)
=> ( s__instance(X1,s__SetOrClass)
& s__instance(X15,s__SetOrClass) ) ),
file('/export/starexec/sandbox/tmp/tmp.L3IA7ZspyT/E---3.1_31971.p',kb_SUMO_26635) ).
fof(kb_SUMO_28267,axiom,
! [X1034,X1035] :
( ( s__instance(X1035,s__SetOrClass)
& s__instance(X1034,s__SetOrClass) )
=> ( ( s__subclass(X1034,X1035)
& s__subclass(X1035,X1034) )
=> X1034 = X1035 ) ),
file('/export/starexec/sandbox/tmp/tmp.L3IA7ZspyT/E---3.1_31971.p',kb_SUMO_28267) ).
fof(local_8,axiom,
s__subclass(s__Class31_2,s__Class31_3),
file('/export/starexec/sandbox/tmp/tmp.L3IA7ZspyT/E---3.1_31971.p',local_8) ).
fof(local_7,axiom,
s__subclass(s__Class31_1,s__Class31_2),
file('/export/starexec/sandbox/tmp/tmp.L3IA7ZspyT/E---3.1_31971.p',local_7) ).
fof(local_9,axiom,
s__subclass(s__Class31_3,s__Class31_1),
file('/export/starexec/sandbox/tmp/tmp.L3IA7ZspyT/E---3.1_31971.p',local_9) ).
fof(prove_from_ALL,conjecture,
s__instance(s__Animal31,s__Class31_1),
file('/export/starexec/sandbox/tmp/tmp.L3IA7ZspyT/E---3.1_31971.p',prove_from_ALL) ).
fof(local_10,axiom,
s__instance(s__Animal31,s__Class31_2),
file('/export/starexec/sandbox/tmp/tmp.L3IA7ZspyT/E---3.1_31971.p',local_10) ).
fof(c_0_8,plain,
! [X2349,X2350,X2351] :
( ~ s__instance(X2351,s__SetOrClass)
| ~ s__instance(X2350,s__SetOrClass)
| ~ s__instance(X2349,s__SetOrClass)
| ~ s__subclass(X2349,X2350)
| ~ s__subclass(X2350,X2351)
| s__subclass(X2349,X2351) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_28461])])]) ).
fof(c_0_9,plain,
! [X2341,X2342] :
( ( s__instance(X2341,s__SetOrClass)
| ~ s__subclass(X2341,X2342) )
& ( s__instance(X2342,s__SetOrClass)
| ~ s__subclass(X2341,X2342) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26635])])])]) ).
fof(c_0_10,plain,
! [X2347,X2348] :
( ~ s__instance(X2348,s__SetOrClass)
| ~ s__instance(X2347,s__SetOrClass)
| ~ s__subclass(X2347,X2348)
| ~ s__subclass(X2348,X2347)
| X2347 = X2348 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_28267])])]) ).
cnf(c_0_11,plain,
( s__subclass(X3,X1)
| ~ s__instance(X1,s__SetOrClass)
| ~ s__instance(X2,s__SetOrClass)
| ~ s__instance(X3,s__SetOrClass)
| ~ s__subclass(X3,X2)
| ~ s__subclass(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( X2 = X1
| ~ s__instance(X1,s__SetOrClass)
| ~ s__instance(X2,s__SetOrClass)
| ~ s__subclass(X2,X1)
| ~ s__subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( s__subclass(X1,X2)
| ~ s__subclass(X1,X3)
| ~ s__subclass(X3,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_13]) ).
cnf(c_0_16,plain,
s__subclass(s__Class31_2,s__Class31_3),
inference(split_conjunct,[status(thm)],[local_8]) ).
cnf(c_0_17,plain,
( X1 = X2
| ~ s__subclass(X2,X1)
| ~ s__subclass(X1,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_14,c_0_13]),c_0_13]) ).
cnf(c_0_18,plain,
s__subclass(s__Class31_1,s__Class31_2),
inference(split_conjunct,[status(thm)],[local_7]) ).
cnf(c_0_19,plain,
( s__subclass(s__Class31_2,X1)
| ~ s__subclass(s__Class31_3,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
s__subclass(s__Class31_3,s__Class31_1),
inference(split_conjunct,[status(thm)],[local_9]) ).
fof(c_0_21,negated_conjecture,
~ s__instance(s__Animal31,s__Class31_1),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[prove_from_ALL])]) ).
cnf(c_0_22,plain,
( s__Class31_2 = s__Class31_1
| ~ s__subclass(s__Class31_2,s__Class31_1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
s__subclass(s__Class31_2,s__Class31_1),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
fof(c_0_24,negated_conjecture,
~ s__instance(s__Animal31,s__Class31_1),
inference(fof_nnf,[status(thm)],[c_0_21]) ).
cnf(c_0_25,plain,
s__instance(s__Animal31,s__Class31_2),
inference(split_conjunct,[status(thm)],[local_10]) ).
cnf(c_0_26,plain,
s__Class31_2 = s__Class31_1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]) ).
cnf(c_0_27,negated_conjecture,
~ s__instance(s__Animal31,s__Class31_1),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_28,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 35.38/35.50 % Problem : CSR100+6 : TPTP v8.1.2. Bugfixed v7.3.0.
% 35.45/35.52 % Command : run_E %s %d THM
% 35.50/35.72 % Computer : n007.cluster.edu
% 35.50/35.72 % Model : x86_64 x86_64
% 35.50/35.72 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 35.50/35.72 % Memory : 8042.1875MB
% 35.50/35.72 % OS : Linux 3.10.0-693.el7.x86_64
% 35.50/35.72 % CPULimit : 300
% 35.50/35.72 % WCLimit : 300
% 35.50/35.72 % DateTime : Fri May 3 14:24:28 EDT 2024
% 35.50/35.72 % CPUTime :
% 64.22/64.49 Running first-order theorem proving
% 64.22/64.50 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.L3IA7ZspyT/E---3.1_31971.p
% 68.44/66.99 # Version: 3.1.0
% 68.44/66.99 # Preprocessing class: FMLLSMSLSSSNFFN.
% 68.44/66.99 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 68.44/66.99 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1495s (5) cores
% 68.44/66.99 # Starting new_bool_3 with 299s (1) cores
% 68.44/66.99 # Starting new_bool_1 with 299s (1) cores
% 68.44/66.99 # Starting sh5l with 299s (1) cores
% 68.44/66.99 # new_bool_1 with pid 1348 completed with status 0
% 68.44/66.99 # Result found by new_bool_1
% 68.44/66.99 # Preprocessing class: FMLLSMSLSSSNFFN.
% 68.44/66.99 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 68.44/66.99 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1495s (5) cores
% 68.44/66.99 # Starting new_bool_3 with 299s (1) cores
% 68.44/66.99 # Starting new_bool_1 with 299s (1) cores
% 68.44/66.99 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 68.44/66.99 # Search class: FHUSF-FFSM00-SFFFFFNN
% 68.44/66.99 # partial match(1): FHUNF-FFSM00-SFFFFFNN
% 68.44/66.99 # Scheduled 5 strats onto 1 cores with 299 seconds (299 total)
% 68.44/66.99 # Starting SAT001_MinMin_p005000_rr_RG with 180s (1) cores
% 68.44/66.99 # SAT001_MinMin_p005000_rr_RG with pid 1355 completed with status 0
% 68.44/66.99 # Result found by SAT001_MinMin_p005000_rr_RG
% 68.44/66.99 # Preprocessing class: FMLLSMSLSSSNFFN.
% 68.44/66.99 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 68.44/66.99 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1495s (5) cores
% 68.44/66.99 # Starting new_bool_3 with 299s (1) cores
% 68.44/66.99 # Starting new_bool_1 with 299s (1) cores
% 68.44/66.99 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 68.44/66.99 # Search class: FHUSF-FFSM00-SFFFFFNN
% 68.44/66.99 # partial match(1): FHUNF-FFSM00-SFFFFFNN
% 68.44/66.99 # Scheduled 5 strats onto 1 cores with 299 seconds (299 total)
% 68.44/66.99 # Starting SAT001_MinMin_p005000_rr_RG with 180s (1) cores
% 68.44/66.99 # Preprocessing time : 0.064 s
% 68.44/66.99 # Presaturation interreduction done
% 68.44/66.99
% 68.44/66.99 # Proof found!
% 68.44/66.99 # SZS status Theorem
% 68.44/66.99 # SZS output start CNFRefutation
% See solution above
% 68.44/66.99 # Parsed axioms : 55597
% 68.44/66.99 # Removed by relevancy pruning/SinE : 55576
% 68.44/66.99 # Initial clauses : 24
% 68.44/66.99 # Removed in clause preprocessing : 4
% 68.44/66.99 # Initial clauses in saturation : 20
% 68.44/66.99 # Processed clauses : 78
% 68.44/66.99 # ...of these trivial : 5
% 68.44/66.99 # ...subsumed : 0
% 68.44/66.99 # ...remaining for further processing : 73
% 68.44/66.99 # Other redundant clauses eliminated : 0
% 68.44/66.99 # Clauses deleted for lack of memory : 0
% 68.44/66.99 # Backward-subsumed : 0
% 68.44/66.99 # Backward-rewritten : 13
% 68.44/66.99 # Generated clauses : 96
% 68.44/66.99 # ...of the previous two non-redundant : 57
% 68.44/66.99 # ...aggressively subsumed : 0
% 68.44/66.99 # Contextual simplify-reflections : 7
% 68.44/66.99 # Paramodulations : 96
% 68.44/66.99 # Factorizations : 0
% 68.44/66.99 # NegExts : 0
% 68.44/66.99 # Equation resolutions : 0
% 68.44/66.99 # Disequality decompositions : 0
% 68.44/66.99 # Total rewrite steps : 53
% 68.44/66.99 # ...of those cached : 37
% 68.44/66.99 # Propositional unsat checks : 0
% 68.44/66.99 # Propositional check models : 0
% 68.44/66.99 # Propositional check unsatisfiable : 0
% 68.44/66.99 # Propositional clauses : 0
% 68.44/66.99 # Propositional clauses after purity: 0
% 68.44/66.99 # Propositional unsat core size : 0
% 68.44/66.99 # Propositional preprocessing time : 0.000
% 68.44/66.99 # Propositional encoding time : 0.000
% 68.44/66.99 # Propositional solver time : 0.000
% 68.44/66.99 # Success case prop preproc time : 0.000
% 68.44/66.99 # Success case prop encoding time : 0.000
% 68.44/66.99 # Success case prop solver time : 0.000
% 68.44/66.99 # Current number of processed clauses : 40
% 68.44/66.99 # Positive orientable unit clauses : 23
% 68.44/66.99 # Positive unorientable unit clauses: 0
% 68.44/66.99 # Negative unit clauses : 1
% 68.44/66.99 # Non-unit-clauses : 16
% 68.44/66.99 # Current number of unprocessed clauses: 15
% 68.44/66.99 # ...number of literals in the above : 29
% 68.44/66.99 # Current number of archived formulas : 0
% 68.44/66.99 # Current number of archived clauses : 33
% 68.44/66.99 # Clause-clause subsumption calls (NU) : 31
% 68.44/66.99 # Rec. Clause-clause subsumption calls : 20
% 68.44/66.99 # Non-unit clause-clause subsumptions : 7
% 68.44/66.99 # Unit Clause-clause subsumption calls : 0
% 68.44/66.99 # Rewrite failures with RHS unbound : 0
% 68.44/66.99 # BW rewrite match attempts : 2
% 68.44/66.99 # BW rewrite match successes : 2
% 68.44/66.99 # Condensation attempts : 0
% 68.44/66.99 # Condensation successes : 0
% 68.44/66.99 # Termbank termtop insertions : 649977
% 68.44/66.99 # Search garbage collected termcells : 291018
% 68.44/66.99
% 68.44/66.99 # -------------------------------------------------
% 68.44/66.99 # User time : 0.236 s
% 68.44/66.99 # System time : 0.165 s
% 68.44/66.99 # Total time : 0.400 s
% 68.44/66.99 # Maximum resident set size: 132576 pages
% 68.44/66.99
% 68.44/66.99 # -------------------------------------------------
% 68.44/66.99 # User time : 2.142 s
% 68.44/66.99 # System time : 0.245 s
% 68.44/66.99 # Total time : 2.386 s
% 68.44/66.99 # Maximum resident set size: 58284 pages
% 68.44/66.99 % E---3.1 exiting
% 68.44/67.00 % E exiting
%------------------------------------------------------------------------------