TSTP Solution File: CSR104+2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR104+2 : 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:37 EDT 2024
% Result : Theorem 4.12s 1.54s
% Output : CNFRefutation 4.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of formulae : 40 ( 23 unt; 0 def)
% Number of atoms : 89 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 86 ( 37 ~; 34 |; 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_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/benchmark/Axioms/CSR003+1.ax',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/benchmark/Axioms/CSR003+1.ax',kb_SUMO_26) ).
fof(kb_SUMO_1016,axiom,
s__subclass(s__TimePoint,s__TimePosition),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+1.ax',kb_SUMO_1016) ).
fof(kb_SUMO_1012,axiom,
s__subclass(s__TimeInterval,s__TimePosition),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+1.ax',kb_SUMO_1012) ).
fof(kb_SUMO_1502,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/benchmark/Axioms/CSR003+1.ax',kb_SUMO_1502) ).
fof(local_1,axiom,
s__instance(s__TimePoint35_1,s__TimePoint),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_1) ).
fof(local_2,axiom,
s__instance(s__TimeInterval35_1,s__TimeInterval),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_2) ).
fof(kb_SUMO_68,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/benchmark/Axioms/CSR003+1.ax',kb_SUMO_68) ).
fof(prove_from_SUMO_MILO,conjecture,
s__temporalPart(s__TimePoint35_1,s__TimeInterval35_2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_from_SUMO_MILO) ).
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(c_0_12,plain,
! [X1465,X1466,X1467] :
( ~ s__instance(X1466,s__SetOrClass)
| ~ s__instance(X1465,s__SetOrClass)
| ~ s__subclass(X1465,X1466)
| ~ s__instance(X1467,X1465)
| s__instance(X1467,X1466) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_27])])]) ).
fof(c_0_13,plain,
! [X1463,X1464] :
( ( s__instance(X1463,s__SetOrClass)
| ~ s__subclass(X1463,X1464) )
& ( s__instance(X1464,s__SetOrClass)
| ~ s__subclass(X1463,X1464) ) ),
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__subclass(s__TimePoint,s__TimePosition),
inference(split_conjunct,[status(thm)],[kb_SUMO_1016]) ).
cnf(c_0_19,plain,
s__subclass(s__TimeInterval,s__TimePosition),
inference(split_conjunct,[status(thm)],[kb_SUMO_1012]) ).
fof(c_0_20,plain,
! [X1230,X1231,X1232] :
( ~ s__instance(X1232,s__TimePosition)
| ~ s__instance(X1231,s__TimePosition)
| ~ s__instance(X1230,s__TimePosition)
| ~ s__temporalPart(X1230,X1231)
| ~ s__temporalPart(X1231,X1232)
| s__temporalPart(X1230,X1232) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_1502])])]) ).
cnf(c_0_21,plain,
( s__instance(X1,s__TimePosition)
| ~ s__instance(X1,s__TimePoint) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
s__instance(s__TimePoint35_1,s__TimePoint),
inference(split_conjunct,[status(thm)],[local_1]) ).
cnf(c_0_23,plain,
( s__instance(X1,s__TimePosition)
| ~ s__instance(X1,s__TimeInterval) ),
inference(spm,[status(thm)],[c_0_17,c_0_19]) ).
cnf(c_0_24,plain,
s__instance(s__TimeInterval35_1,s__TimeInterval),
inference(split_conjunct,[status(thm)],[local_2]) ).
fof(c_0_25,plain,
! [X1392,X1393] :
( ~ s__instance(X1393,s__TimeInterval)
| ~ s__instance(X1392,s__TimeInterval)
| ~ s__during(X1392,X1393)
| s__temporalPart(X1392,X1393) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_68])])]) ).
fof(c_0_26,negated_conjecture,
~ s__temporalPart(s__TimePoint35_1,s__TimeInterval35_2),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[prove_from_SUMO_MILO])]) ).
cnf(c_0_27,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_20]) ).
cnf(c_0_28,plain,
s__temporalPart(s__TimePoint35_1,s__TimeInterval35_1),
inference(split_conjunct,[status(thm)],[local_4]) ).
cnf(c_0_29,plain,
s__instance(s__TimePoint35_1,s__TimePosition),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_30,plain,
s__instance(s__TimeInterval35_1,s__TimePosition),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,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_25]) ).
cnf(c_0_32,plain,
s__during(s__TimeInterval35_1,s__TimeInterval35_2),
inference(split_conjunct,[status(thm)],[local_5]) ).
cnf(c_0_33,plain,
s__instance(s__TimeInterval35_2,s__TimeInterval),
inference(split_conjunct,[status(thm)],[local_3]) ).
fof(c_0_34,negated_conjecture,
~ s__temporalPart(s__TimePoint35_1,s__TimeInterval35_2),
inference(fof_nnf,[status(thm)],[c_0_26]) ).
cnf(c_0_35,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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_30])]) ).
cnf(c_0_36,plain,
s__temporalPart(s__TimeInterval35_1,s__TimeInterval35_2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_24]),c_0_33])]) ).
cnf(c_0_37,plain,
s__instance(s__TimeInterval35_2,s__TimePosition),
inference(spm,[status(thm)],[c_0_23,c_0_33]) ).
cnf(c_0_38,negated_conjecture,
~ s__temporalPart(s__TimePoint35_1,s__TimeInterval35_2),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_39,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]),c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : CSR104+2 : TPTP v8.2.0. Bugfixed v7.3.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n029.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Sun May 19 02:04:53 EDT 2024
% 0.13/0.34 % 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
% 4.12/1.54 # Version: 3.1.0
% 4.12/1.54 # Preprocessing class: FMLLSMSLSSSNFFN.
% 4.12/1.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.12/1.54 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 4.12/1.54 # Starting new_bool_3 with 300s (1) cores
% 4.12/1.54 # Starting new_bool_1 with 300s (1) cores
% 4.12/1.54 # Starting sh5l with 300s (1) cores
% 4.12/1.54 # new_bool_1 with pid 3247 completed with status 0
% 4.12/1.54 # Result found by new_bool_1
% 4.12/1.54 # Preprocessing class: FMLLSMSLSSSNFFN.
% 4.12/1.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.12/1.54 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 4.12/1.54 # Starting new_bool_3 with 300s (1) cores
% 4.12/1.54 # Starting new_bool_1 with 300s (1) cores
% 4.12/1.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.12/1.54 # Search class: FGHSS-FSLM31-MFFFFFNN
% 4.12/1.54 # partial match(1): FGHSM-FSLM31-MFFFFFNN
% 4.12/1.54 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 4.12/1.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 135s (1) cores
% 4.12/1.54 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 3250 completed with status 0
% 4.12/1.54 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 4.12/1.54 # Preprocessing class: FMLLSMSLSSSNFFN.
% 4.12/1.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.12/1.54 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 4.12/1.54 # Starting new_bool_3 with 300s (1) cores
% 4.12/1.54 # Starting new_bool_1 with 300s (1) cores
% 4.12/1.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.12/1.54 # Search class: FGHSS-FSLM31-MFFFFFNN
% 4.12/1.54 # partial match(1): FGHSM-FSLM31-MFFFFFNN
% 4.12/1.54 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 4.12/1.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 135s (1) cores
% 4.12/1.54 # Preprocessing time : 0.012 s
% 4.12/1.54 # Presaturation interreduction done
% 4.12/1.54
% 4.12/1.54 # Proof found!
% 4.12/1.54 # SZS status Theorem
% 4.12/1.54 # SZS output start CNFRefutation
% See solution above
% 4.12/1.54 # Parsed axioms : 37987
% 4.12/1.54 # Removed by relevancy pruning/SinE : 37565
% 4.12/1.54 # Initial clauses : 524
% 4.12/1.54 # Removed in clause preprocessing : 4
% 4.12/1.54 # Initial clauses in saturation : 520
% 4.12/1.54 # Processed clauses : 2869
% 4.12/1.54 # ...of these trivial : 378
% 4.12/1.54 # ...subsumed : 9
% 4.12/1.54 # ...remaining for further processing : 2482
% 4.12/1.54 # Other redundant clauses eliminated : 3
% 4.12/1.54 # Clauses deleted for lack of memory : 0
% 4.12/1.54 # Backward-subsumed : 1
% 4.12/1.54 # Backward-rewritten : 37
% 4.12/1.54 # Generated clauses : 4371
% 4.12/1.54 # ...of the previous two non-redundant : 3407
% 4.12/1.54 # ...aggressively subsumed : 0
% 4.12/1.54 # Contextual simplify-reflections : 52
% 4.12/1.54 # Paramodulations : 4367
% 4.12/1.54 # Factorizations : 0
% 4.12/1.54 # NegExts : 0
% 4.12/1.54 # Equation resolutions : 4
% 4.12/1.54 # Disequality decompositions : 0
% 4.12/1.54 # Total rewrite steps : 2347
% 4.12/1.54 # ...of those cached : 1799
% 4.12/1.54 # Propositional unsat checks : 0
% 4.12/1.54 # Propositional check models : 0
% 4.12/1.54 # Propositional check unsatisfiable : 0
% 4.12/1.54 # Propositional clauses : 0
% 4.12/1.54 # Propositional clauses after purity: 0
% 4.12/1.54 # Propositional unsat core size : 0
% 4.12/1.54 # Propositional preprocessing time : 0.000
% 4.12/1.54 # Propositional encoding time : 0.000
% 4.12/1.54 # Propositional solver time : 0.000
% 4.12/1.54 # Success case prop preproc time : 0.000
% 4.12/1.54 # Success case prop encoding time : 0.000
% 4.12/1.54 # Success case prop solver time : 0.000
% 4.12/1.54 # Current number of processed clauses : 1941
% 4.12/1.54 # Positive orientable unit clauses : 935
% 4.12/1.54 # Positive unorientable unit clauses: 0
% 4.12/1.54 # Negative unit clauses : 1
% 4.12/1.54 # Non-unit-clauses : 1005
% 4.12/1.54 # Current number of unprocessed clauses: 1558
% 4.12/1.54 # ...number of literals in the above : 2258
% 4.12/1.54 # Current number of archived formulas : 0
% 4.12/1.54 # Current number of archived clauses : 538
% 4.12/1.54 # Clause-clause subsumption calls (NU) : 138105
% 4.12/1.54 # Rec. Clause-clause subsumption calls : 67241
% 4.12/1.54 # Non-unit clause-clause subsumptions : 62
% 4.12/1.54 # Unit Clause-clause subsumption calls : 186937
% 4.12/1.54 # Rewrite failures with RHS unbound : 0
% 4.12/1.54 # BW rewrite match attempts : 494
% 4.12/1.54 # BW rewrite match successes : 26
% 4.12/1.54 # Condensation attempts : 0
% 4.12/1.54 # Condensation successes : 0
% 4.12/1.54 # Termbank termtop insertions : 345020
% 4.12/1.54 # Search garbage collected termcells : 130008
% 4.12/1.54
% 4.12/1.54 # -------------------------------------------------
% 4.12/1.54 # User time : 0.415 s
% 4.12/1.54 # System time : 0.075 s
% 4.12/1.54 # Total time : 0.489 s
% 4.12/1.54 # Maximum resident set size: 49540 pages
% 4.12/1.54
% 4.12/1.54 # -------------------------------------------------
% 4.12/1.54 # User time : 0.930 s
% 4.12/1.54 # System time : 0.096 s
% 4.12/1.54 # Total time : 1.025 s
% 4.12/1.54 # Maximum resident set size: 27828 pages
% 4.12/1.54 % E---3.1 exiting
% 4.12/1.54 % E exiting
%------------------------------------------------------------------------------