TSTP Solution File: CSR104+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR104+1 : TPTP v8.1.2. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:36 EDT 2024
% Result : Theorem 4.41s 5.04s
% Output : CNFRefutation 4.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of formulae : 43 ( 23 unt; 0 def)
% Number of atoms : 99 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 100 ( 44 ~; 41 |; 8 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 42 ( 2 sgn 20 !; 0 ?)
% 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.ythDixqPKc/E---3.1_31680.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.ythDixqPKc/E---3.1_31680.p',kb_SUMO_26) ).
fof(local_1,axiom,
s__instance(s__TimePoint35_1,s__TimePoint),
file('/export/starexec/sandbox/tmp/tmp.ythDixqPKc/E---3.1_31680.p',local_1) ).
fof(kb_SUMO_1262,axiom,
! [X4,X5,X105] :
( ( s__instance(X105,s__TimePosition)
& s__instance(X5,s__TimePosition)
& s__instance(X4,s__TimePosition) )
=> ( ( s__temporalPart(X4,X5)
& s__temporalPart(X5,X105) )
=> s__temporalPart(X4,X105) ) ),
file('/export/starexec/sandbox/tmp/tmp.ythDixqPKc/E---3.1_31680.p',kb_SUMO_1262) ).
fof(kb_SUMO_912,axiom,
s__subclass(s__TimePoint,s__TimePosition),
file('/export/starexec/sandbox/tmp/tmp.ythDixqPKc/E---3.1_31680.p',kb_SUMO_912) ).
fof(local_2,axiom,
s__instance(s__TimeInterval35_1,s__TimeInterval),
file('/export/starexec/sandbox/tmp/tmp.ythDixqPKc/E---3.1_31680.p',local_2) ).
fof(kb_SUMO_74,axiom,
! [X15,X16] :
( ( s__instance(X16,s__TimeInterval)
& s__instance(X15,s__TimeInterval) )
=> ( s__during(X15,X16)
=> s__temporalPart(X15,X16) ) ),
file('/export/starexec/sandbox/tmp/tmp.ythDixqPKc/E---3.1_31680.p',kb_SUMO_74) ).
fof(kb_SUMO_908,axiom,
s__subclass(s__TimeInterval,s__TimePosition),
file('/export/starexec/sandbox/tmp/tmp.ythDixqPKc/E---3.1_31680.p',kb_SUMO_908) ).
fof(local_3,axiom,
s__instance(s__TimeInterval35_2,s__TimeInterval),
file('/export/starexec/sandbox/tmp/tmp.ythDixqPKc/E---3.1_31680.p',local_3) ).
fof(prove_from_SUMO,conjecture,
s__temporalPart(s__TimePoint35_1,s__TimeInterval35_2),
file('/export/starexec/sandbox/tmp/tmp.ythDixqPKc/E---3.1_31680.p',prove_from_SUMO) ).
fof(local_4,axiom,
s__temporalPart(s__TimePoint35_1,s__TimeInterval35_1),
file('/export/starexec/sandbox/tmp/tmp.ythDixqPKc/E---3.1_31680.p',local_4) ).
fof(local_5,axiom,
s__during(s__TimeInterval35_1,s__TimeInterval35_2),
file('/export/starexec/sandbox/tmp/tmp.ythDixqPKc/E---3.1_31680.p',local_5) ).
fof(c_0_12,plain,
! [X687,X688,X689] :
( ~ s__instance(X688,s__SetOrClass)
| ~ s__instance(X687,s__SetOrClass)
| ~ s__subclass(X687,X688)
| ~ s__instance(X689,X687)
| s__instance(X689,X688) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_27])])]) ).
fof(c_0_13,plain,
! [X685,X686] :
( ( s__instance(X685,s__SetOrClass)
| ~ s__subclass(X685,X686) )
& ( s__instance(X686,s__SetOrClass)
| ~ s__subclass(X685,X686) ) ),
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_14,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_12]) ).
cnf(c_0_15,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
( s__instance(X1,X2)
| ~ s__subclass(X3,X2)
| ~ s__instance(X1,X3) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_18,plain,
s__instance(s__TimePoint35_1,s__TimePoint),
inference(split_conjunct,[status(thm)],[local_1]) ).
fof(c_0_19,plain,
! [X594,X595,X596] :
( ~ s__instance(X596,s__TimePosition)
| ~ s__instance(X595,s__TimePosition)
| ~ s__instance(X594,s__TimePosition)
| ~ s__temporalPart(X594,X595)
| ~ s__temporalPart(X595,X596)
| s__temporalPart(X594,X596) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_1262])])]) ).
cnf(c_0_20,plain,
( s__instance(s__TimePoint35_1,X1)
| ~ s__subclass(s__TimePoint,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
s__subclass(s__TimePoint,s__TimePosition),
inference(split_conjunct,[status(thm)],[kb_SUMO_912]) ).
cnf(c_0_22,plain,
s__instance(s__TimeInterval35_1,s__TimeInterval),
inference(split_conjunct,[status(thm)],[local_2]) ).
fof(c_0_23,plain,
! [X663,X664] :
( ~ s__instance(X664,s__TimeInterval)
| ~ s__instance(X663,s__TimeInterval)
| ~ s__during(X663,X664)
| s__temporalPart(X663,X664) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_74])])]) ).
cnf(c_0_24,plain,
( s__temporalPart(X3,X1)
| ~ s__instance(X1,s__TimePosition)
| ~ s__instance(X2,s__TimePosition)
| ~ s__instance(X3,s__TimePosition)
| ~ s__temporalPart(X3,X2)
| ~ s__temporalPart(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,plain,
s__instance(s__TimePoint35_1,s__TimePosition),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
( s__instance(s__TimeInterval35_1,X1)
| ~ s__subclass(s__TimeInterval,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_22]) ).
cnf(c_0_27,plain,
s__subclass(s__TimeInterval,s__TimePosition),
inference(split_conjunct,[status(thm)],[kb_SUMO_908]) ).
cnf(c_0_28,plain,
s__instance(s__TimeInterval35_2,s__TimeInterval),
inference(split_conjunct,[status(thm)],[local_3]) ).
cnf(c_0_29,plain,
( s__temporalPart(X2,X1)
| ~ s__instance(X1,s__TimeInterval)
| ~ s__instance(X2,s__TimeInterval)
| ~ s__during(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_30,negated_conjecture,
~ s__temporalPart(s__TimePoint35_1,s__TimeInterval35_2),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[prove_from_SUMO])]) ).
cnf(c_0_31,plain,
( s__temporalPart(s__TimePoint35_1,X1)
| ~ s__temporalPart(s__TimePoint35_1,X2)
| ~ s__temporalPart(X2,X1)
| ~ s__instance(X2,s__TimePosition)
| ~ s__instance(X1,s__TimePosition) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,plain,
s__instance(s__TimeInterval35_1,s__TimePosition),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,plain,
s__temporalPart(s__TimePoint35_1,s__TimeInterval35_1),
inference(split_conjunct,[status(thm)],[local_4]) ).
cnf(c_0_34,plain,
( s__instance(s__TimeInterval35_2,X1)
| ~ s__subclass(s__TimeInterval,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_28]) ).
cnf(c_0_35,plain,
( s__temporalPart(s__TimeInterval35_1,X1)
| ~ s__during(s__TimeInterval35_1,X1)
| ~ s__instance(X1,s__TimeInterval) ),
inference(spm,[status(thm)],[c_0_29,c_0_22]) ).
cnf(c_0_36,plain,
s__during(s__TimeInterval35_1,s__TimeInterval35_2),
inference(split_conjunct,[status(thm)],[local_5]) ).
fof(c_0_37,negated_conjecture,
~ s__temporalPart(s__TimePoint35_1,s__TimeInterval35_2),
inference(fof_nnf,[status(thm)],[c_0_30]) ).
cnf(c_0_38,plain,
( s__temporalPart(s__TimePoint35_1,X1)
| ~ s__temporalPart(s__TimeInterval35_1,X1)
| ~ s__instance(X1,s__TimePosition) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]) ).
cnf(c_0_39,plain,
s__instance(s__TimeInterval35_2,s__TimePosition),
inference(spm,[status(thm)],[c_0_34,c_0_27]) ).
cnf(c_0_40,plain,
s__temporalPart(s__TimeInterval35_1,s__TimeInterval35_2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_28]),c_0_36])]) ).
cnf(c_0_41,negated_conjecture,
~ s__temporalPart(s__TimePoint35_1,s__TimeInterval35_2),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_42,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]),c_0_41]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 1.64/1.64 % Problem : CSR104+1 : TPTP v8.1.2. Bugfixed v7.3.0.
% 1.64/1.65 % Command : run_E %s %d THM
% 1.69/1.86 % Computer : n023.cluster.edu
% 1.69/1.86 % Model : x86_64 x86_64
% 1.69/1.86 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 1.69/1.86 % Memory : 8042.1875MB
% 1.69/1.86 % OS : Linux 3.10.0-693.el7.x86_64
% 1.69/1.86 % CPULimit : 300
% 1.69/1.86 % WCLimit : 300
% 1.69/1.86 % DateTime : Fri May 3 14:51:54 EDT 2024
% 1.69/1.86 % CPUTime :
% 4.30/4.55 Running first-order theorem proving
% 4.30/4.55 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.ythDixqPKc/E---3.1_31680.p
% 4.41/5.04 # Version: 3.1.0
% 4.41/5.04 # Preprocessing class: FMLLSMSLSSSNFFN.
% 4.41/5.04 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.41/5.04 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 4.41/5.04 # Starting new_bool_3 with 300s (1) cores
% 4.41/5.04 # Starting new_bool_1 with 300s (1) cores
% 4.41/5.04 # Starting sh5l with 300s (1) cores
% 4.41/5.04 # new_bool_3 with pid 31759 completed with status 0
% 4.41/5.04 # Result found by new_bool_3
% 4.41/5.04 # Preprocessing class: FMLLSMSLSSSNFFN.
% 4.41/5.04 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.41/5.04 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 4.41/5.04 # Starting new_bool_3 with 300s (1) cores
% 4.41/5.04 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.41/5.04 # Search class: FGHSS-FSLM21-MFFFFFNN
% 4.41/5.04 # partial match(1): FGHSF-FSLM21-MFFFFFNN
% 4.41/5.04 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 4.41/5.04 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 4.41/5.04 # G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 31763 completed with status 0
% 4.41/5.04 # Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 4.41/5.04 # Preprocessing class: FMLLSMSLSSSNFFN.
% 4.41/5.04 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.41/5.04 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 4.41/5.04 # Starting new_bool_3 with 300s (1) cores
% 4.41/5.04 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.41/5.04 # Search class: FGHSS-FSLM21-MFFFFFNN
% 4.41/5.04 # partial match(1): FGHSF-FSLM21-MFFFFFNN
% 4.41/5.04 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 4.41/5.04 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 4.41/5.04 # Preprocessing time : 0.008 s
% 4.41/5.04 # Presaturation interreduction done
% 4.41/5.04
% 4.41/5.04 # Proof found!
% 4.41/5.04 # SZS status Theorem
% 4.41/5.04 # SZS output start CNFRefutation
% See solution above
% 4.41/5.04 # Parsed axioms : 14793
% 4.41/5.04 # Removed by relevancy pruning/SinE : 14609
% 4.41/5.04 # Initial clauses : 209
% 4.41/5.04 # Removed in clause preprocessing : 4
% 4.41/5.04 # Initial clauses in saturation : 205
% 4.41/5.04 # Processed clauses : 2484
% 4.41/5.04 # ...of these trivial : 129
% 4.41/5.04 # ...subsumed : 331
% 4.41/5.04 # ...remaining for further processing : 2024
% 4.41/5.04 # Other redundant clauses eliminated : 3
% 4.41/5.04 # Clauses deleted for lack of memory : 0
% 4.41/5.04 # Backward-subsumed : 22
% 4.41/5.04 # Backward-rewritten : 77
% 4.41/5.04 # Generated clauses : 5485
% 4.41/5.04 # ...of the previous two non-redundant : 4708
% 4.41/5.04 # ...aggressively subsumed : 0
% 4.41/5.04 # Contextual simplify-reflections : 17
% 4.41/5.04 # Paramodulations : 5482
% 4.41/5.04 # Factorizations : 0
% 4.41/5.04 # NegExts : 0
% 4.41/5.04 # Equation resolutions : 3
% 4.41/5.04 # Disequality decompositions : 0
% 4.41/5.04 # Total rewrite steps : 2525
% 4.41/5.04 # ...of those cached : 2141
% 4.41/5.04 # Propositional unsat checks : 0
% 4.41/5.04 # Propositional check models : 0
% 4.41/5.04 # Propositional check unsatisfiable : 0
% 4.41/5.04 # Propositional clauses : 0
% 4.41/5.04 # Propositional clauses after purity: 0
% 4.41/5.04 # Propositional unsat core size : 0
% 4.41/5.04 # Propositional preprocessing time : 0.000
% 4.41/5.04 # Propositional encoding time : 0.000
% 4.41/5.04 # Propositional solver time : 0.000
% 4.41/5.04 # Success case prop preproc time : 0.000
% 4.41/5.04 # Success case prop encoding time : 0.000
% 4.41/5.04 # Success case prop solver time : 0.000
% 4.41/5.04 # Current number of processed clauses : 1728
% 4.41/5.04 # Positive orientable unit clauses : 524
% 4.41/5.04 # Positive unorientable unit clauses: 0
% 4.41/5.04 # Negative unit clauses : 37
% 4.41/5.04 # Non-unit-clauses : 1167
% 4.41/5.04 # Current number of unprocessed clauses: 2562
% 4.41/5.04 # ...number of literals in the above : 8550
% 4.41/5.04 # Current number of archived formulas : 0
% 4.41/5.04 # Current number of archived clauses : 293
% 4.41/5.04 # Clause-clause subsumption calls (NU) : 109988
% 4.41/5.04 # Rec. Clause-clause subsumption calls : 58797
% 4.41/5.04 # Non-unit clause-clause subsumptions : 65
% 4.41/5.04 # Unit Clause-clause subsumption calls : 15273
% 4.41/5.04 # Rewrite failures with RHS unbound : 0
% 4.41/5.04 # BW rewrite match attempts : 493
% 4.41/5.04 # BW rewrite match successes : 34
% 4.41/5.04 # Condensation attempts : 0
% 4.41/5.04 # Condensation successes : 0
% 4.41/5.04 # Termbank termtop insertions : 209717
% 4.41/5.04 # Search garbage collected termcells : 54438
% 4.41/5.04
% 4.41/5.04 # -------------------------------------------------
% 4.41/5.04 # User time : 0.208 s
% 4.41/5.04 # System time : 0.051 s
% 4.41/5.04 # Total time : 0.259 s
% 4.41/5.04 # Maximum resident set size: 20252 pages
% 4.41/5.04
% 4.41/5.04 # -------------------------------------------------
% 4.41/5.04 # User time : 0.403 s
% 4.41/5.04 # System time : 0.066 s
% 4.41/5.04 # Total time : 0.470 s
% 4.41/5.04 # Maximum resident set size: 12664 pages
% 4.41/5.04 % E---3.1 exiting
% 4.41/5.04 % E exiting
%------------------------------------------------------------------------------