TSTP Solution File: CSR104+3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR104+3 : TPTP v8.2.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:14:38 EDT 2024
% Result : Theorem 5.81s 3.85s
% Output : CNFRefutation 5.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of formulae : 40 ( 21 unt; 0 def)
% Number of atoms : 94 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 99 ( 45 ~; 39 |; 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 : 38 ( 2 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(kb_SUMO_28419,axiom,
! [X1034,X1035,X1097] :
( ( s__instance(X1097,s__TimePosition)
& s__instance(X1035,s__TimePosition)
& s__instance(X1034,s__TimePosition) )
=> ( ( s__temporalPart(X1034,X1035)
& s__temporalPart(X1035,X1097) )
=> s__temporalPart(X1034,X1097) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+2.ax',kb_SUMO_28419) ).
fof(kb_SUMO_26696,axiom,
! [X548,X550] :
( ( s__instance(X550,s__TimeInterval)
& s__instance(X548,s__TimeInterval) )
=> ( s__during(X548,X550)
=> s__temporalPart(X548,X550) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+2.ax',kb_SUMO_26696) ).
fof(prove_from_ALL,conjecture,
s__temporalPart(s__TimePoint35_1,s__TimeInterval35_2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_from_ALL) ).
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/sandbox/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/sandbox/benchmark/Axioms/CSR003+2.ax',kb_SUMO_26635) ).
fof(local_4,axiom,
s__temporalPart(s__TimePoint35_1,s__TimeInterval35_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_4) ).
fof(local_5,axiom,
s__during(s__TimeInterval35_1,s__TimeInterval35_2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_5) ).
fof(local_3,axiom,
s__instance(s__TimeInterval35_2,s__TimeInterval),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_3) ).
fof(local_2,axiom,
s__instance(s__TimeInterval35_1,s__TimeInterval),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_2) ).
fof(kb_SUMO_27777,axiom,
s__subclass(s__TimeInterval,s__TimePosition),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+2.ax',kb_SUMO_27777) ).
fof(kb_SUMO_27781,axiom,
s__subclass(s__TimePoint,s__TimePosition),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+2.ax',kb_SUMO_27781) ).
fof(local_1,axiom,
s__instance(s__TimePoint35_1,s__TimePoint),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_1) ).
fof(c_0_12,plain,
! [X2378,X2379,X2380] :
( ~ s__instance(X2380,s__TimePosition)
| ~ s__instance(X2379,s__TimePosition)
| ~ s__instance(X2378,s__TimePosition)
| ~ s__temporalPart(X2378,X2379)
| ~ s__temporalPart(X2379,X2380)
| s__temporalPart(X2378,X2380) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_28419])])]) ).
fof(c_0_13,plain,
! [X2369,X2370] :
( ~ s__instance(X2370,s__TimeInterval)
| ~ s__instance(X2369,s__TimeInterval)
| ~ s__during(X2369,X2370)
| s__temporalPart(X2369,X2370) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26696])])]) ).
fof(c_0_14,negated_conjecture,
~ s__temporalPart(s__TimePoint35_1,s__TimeInterval35_2),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[prove_from_ALL])]) ).
fof(c_0_15,plain,
! [X2417,X2418,X2419] :
( ~ s__instance(X2418,s__SetOrClass)
| ~ s__instance(X2417,s__SetOrClass)
| ~ s__subclass(X2417,X2418)
| ~ s__instance(X2419,X2417)
| s__instance(X2419,X2418) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26636])])]) ).
fof(c_0_16,plain,
! [X2415,X2416] :
( ( s__instance(X2415,s__SetOrClass)
| ~ s__subclass(X2415,X2416) )
& ( s__instance(X2416,s__SetOrClass)
| ~ s__subclass(X2415,X2416) ) ),
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_17,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_12]) ).
cnf(c_0_18,plain,
s__temporalPart(s__TimePoint35_1,s__TimeInterval35_1),
inference(split_conjunct,[status(thm)],[local_4]) ).
cnf(c_0_19,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_13]) ).
cnf(c_0_20,plain,
s__during(s__TimeInterval35_1,s__TimeInterval35_2),
inference(split_conjunct,[status(thm)],[local_5]) ).
cnf(c_0_21,plain,
s__instance(s__TimeInterval35_2,s__TimeInterval),
inference(split_conjunct,[status(thm)],[local_3]) ).
cnf(c_0_22,plain,
s__instance(s__TimeInterval35_1,s__TimeInterval),
inference(split_conjunct,[status(thm)],[local_2]) ).
fof(c_0_23,negated_conjecture,
~ s__temporalPart(s__TimePoint35_1,s__TimeInterval35_2),
inference(fof_nnf,[status(thm)],[c_0_14]) ).
cnf(c_0_24,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_15]) ).
cnf(c_0_25,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_26,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_27,plain,
( s__temporalPart(s__TimePoint35_1,X1)
| ~ s__temporalPart(s__TimeInterval35_1,X1)
| ~ s__instance(s__TimePoint35_1,s__TimePosition)
| ~ s__instance(s__TimeInterval35_1,s__TimePosition)
| ~ s__instance(X1,s__TimePosition) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_28,plain,
s__temporalPart(s__TimeInterval35_1,s__TimeInterval35_2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),c_0_22])]) ).
cnf(c_0_29,negated_conjecture,
~ s__temporalPart(s__TimePoint35_1,s__TimeInterval35_2),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_30,plain,
( s__instance(X1,X2)
| ~ s__instance(X1,X3)
| ~ s__subclass(X3,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_31,plain,
s__subclass(s__TimeInterval,s__TimePosition),
inference(split_conjunct,[status(thm)],[kb_SUMO_27777]) ).
cnf(c_0_32,plain,
( ~ s__instance(s__TimePoint35_1,s__TimePosition)
| ~ s__instance(s__TimeInterval35_1,s__TimePosition)
| ~ s__instance(s__TimeInterval35_2,s__TimePosition) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_33,plain,
( s__instance(X1,s__TimePosition)
| ~ s__instance(X1,s__TimeInterval) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,plain,
s__subclass(s__TimePoint,s__TimePosition),
inference(split_conjunct,[status(thm)],[kb_SUMO_27781]) ).
cnf(c_0_35,plain,
( ~ s__instance(s__TimePoint35_1,s__TimePosition)
| ~ s__instance(s__TimeInterval35_1,s__TimePosition) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_21])]) ).
cnf(c_0_36,plain,
( s__instance(X1,s__TimePosition)
| ~ s__instance(X1,s__TimePoint) ),
inference(spm,[status(thm)],[c_0_30,c_0_34]) ).
cnf(c_0_37,plain,
s__instance(s__TimePoint35_1,s__TimePoint),
inference(split_conjunct,[status(thm)],[local_1]) ).
cnf(c_0_38,plain,
~ s__instance(s__TimePoint35_1,s__TimePosition),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_33]),c_0_22])]) ).
cnf(c_0_39,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : CSR104+3 : TPTP v8.2.0. Bugfixed v7.3.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n029.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sun May 19 00:35:53 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 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/benchmark/theBenchmark.p
% 5.81/3.85 # Version: 3.1.0
% 5.81/3.85 # Preprocessing class: FLLLSMSLSSSNFFN.
% 5.81/3.85 # Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 5.81/3.85 # Starting G-E--_300_C01_S5PRR_S00 with 1490s (5) cores
% 5.81/3.85 # Starting new_bool_3 with 298s (1) cores
% 5.81/3.85 # Starting new_bool_1 with 298s (1) cores
% 5.81/3.85 # Starting sh5l with 298s (1) cores
% 5.81/3.85 # new_bool_3 with pid 31589 completed with status 0
% 5.81/3.85 # Result found by new_bool_3
% 5.81/3.85 # Preprocessing class: FLLLSMSLSSSNFFN.
% 5.81/3.85 # Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 5.81/3.85 # Starting G-E--_300_C01_S5PRR_S00 with 1490s (5) cores
% 5.81/3.85 # Starting new_bool_3 with 298s (1) cores
% 5.81/3.85 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.81/3.85 # Search class: FGHSM-FSLM32-MFFFFFNN
% 5.81/3.85 # Scheduled 12 strats onto 1 cores with 298 seconds (298 total)
% 5.81/3.85 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 5.81/3.85 # G-E--_303_C18_F1_URBAN_S0Y with pid 31593 completed with status 0
% 5.81/3.85 # Result found by G-E--_303_C18_F1_URBAN_S0Y
% 5.81/3.85 # Preprocessing class: FLLLSMSLSSSNFFN.
% 5.81/3.85 # Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 5.81/3.85 # Starting G-E--_300_C01_S5PRR_S00 with 1490s (5) cores
% 5.81/3.85 # Starting new_bool_3 with 298s (1) cores
% 5.81/3.85 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.81/3.85 # Search class: FGHSM-FSLM32-MFFFFFNN
% 5.81/3.85 # Scheduled 12 strats onto 1 cores with 298 seconds (298 total)
% 5.81/3.85 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 5.81/3.85 # Preprocessing time : 0.051 s
% 5.81/3.85
% 5.81/3.85 # Proof found!
% 5.81/3.85 # SZS status Theorem
% 5.81/3.85 # SZS output start CNFRefutation
% See solution above
% 5.81/3.85 # Parsed axioms : 145107
% 5.81/3.85 # Removed by relevancy pruning/SinE : 144612
% 5.81/3.85 # Initial clauses : 624
% 5.81/3.85 # Removed in clause preprocessing : 18
% 5.81/3.85 # Initial clauses in saturation : 606
% 5.81/3.85 # Processed clauses : 1428
% 5.81/3.85 # ...of these trivial : 102
% 5.81/3.85 # ...subsumed : 57
% 5.81/3.85 # ...remaining for further processing : 1269
% 5.81/3.85 # Other redundant clauses eliminated : 3
% 5.81/3.85 # Clauses deleted for lack of memory : 0
% 5.81/3.85 # Backward-subsumed : 23
% 5.81/3.85 # Backward-rewritten : 91
% 5.81/3.85 # Generated clauses : 8178
% 5.81/3.85 # ...of the previous two non-redundant : 8011
% 5.81/3.85 # ...aggressively subsumed : 0
% 5.81/3.85 # Contextual simplify-reflections : 50
% 5.81/3.85 # Paramodulations : 8174
% 5.81/3.85 # Factorizations : 0
% 5.81/3.85 # NegExts : 0
% 5.81/3.85 # Equation resolutions : 4
% 5.81/3.85 # Disequality decompositions : 0
% 5.81/3.85 # Total rewrite steps : 520
% 5.81/3.85 # ...of those cached : 356
% 5.81/3.85 # Propositional unsat checks : 0
% 5.81/3.85 # Propositional check models : 0
% 5.81/3.85 # Propositional check unsatisfiable : 0
% 5.81/3.85 # Propositional clauses : 0
% 5.81/3.85 # Propositional clauses after purity: 0
% 5.81/3.85 # Propositional unsat core size : 0
% 5.81/3.85 # Propositional preprocessing time : 0.000
% 5.81/3.85 # Propositional encoding time : 0.000
% 5.81/3.85 # Propositional solver time : 0.000
% 5.81/3.85 # Success case prop preproc time : 0.000
% 5.81/3.85 # Success case prop encoding time : 0.000
% 5.81/3.85 # Success case prop solver time : 0.000
% 5.81/3.85 # Current number of processed clauses : 1154
% 5.81/3.85 # Positive orientable unit clauses : 297
% 5.81/3.85 # Positive unorientable unit clauses: 0
% 5.81/3.85 # Negative unit clauses : 3
% 5.81/3.85 # Non-unit-clauses : 854
% 5.81/3.85 # Current number of unprocessed clauses: 5670
% 5.81/3.85 # ...number of literals in the above : 24302
% 5.81/3.85 # Current number of archived formulas : 0
% 5.81/3.85 # Current number of archived clauses : 114
% 5.81/3.85 # Clause-clause subsumption calls (NU) : 84221
% 5.81/3.85 # Rec. Clause-clause subsumption calls : 29301
% 5.81/3.85 # Non-unit clause-clause subsumptions : 124
% 5.81/3.85 # Unit Clause-clause subsumption calls : 5936
% 5.81/3.85 # Rewrite failures with RHS unbound : 0
% 5.81/3.85 # BW rewrite match attempts : 242
% 5.81/3.85 # BW rewrite match successes : 55
% 5.81/3.85 # Condensation attempts : 0
% 5.81/3.85 # Condensation successes : 0
% 5.81/3.85 # Termbank termtop insertions : 1139424
% 5.81/3.85 # Search garbage collected termcells : 464599
% 5.81/3.85
% 5.81/3.85 # -------------------------------------------------
% 5.81/3.85 # User time : 0.604 s
% 5.81/3.85 # System time : 0.207 s
% 5.81/3.85 # Total time : 0.811 s
% 5.81/3.85 # Maximum resident set size: 172712 pages
% 5.81/3.85
% 5.81/3.85 # -------------------------------------------------
% 5.81/3.85 # User time : 2.970 s
% 5.81/3.85 # System time : 0.306 s
% 5.81/3.85 # Total time : 3.276 s
% 5.81/3.85 # Maximum resident set size: 98056 pages
% 5.81/3.85 % E---3.1 exiting
% 5.81/3.85 % E exiting
%------------------------------------------------------------------------------