TSTP Solution File: CSR090+5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR090+5 : TPTP v8.2.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:24 EDT 2024
% Result : Theorem 1.52s 1.01s
% Output : CNFRefutation 1.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 34 ( 20 unt; 0 def)
% Number of atoms : 77 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 77 ( 34 ~; 31 |; 7 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 33 ( 2 sgn 16 !; 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_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__Time17_1,s__TimeInterval),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_1) ).
fof(local_2,axiom,
s__instance(s__Time17_2,s__TimeInterval),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_2) ).
fof(prove_from_SUMO_MILO,conjecture,
s__temporalPart(s__Time17_1,s__Time17_3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_from_SUMO_MILO) ).
fof(local_4,axiom,
s__temporalPart(s__Time17_1,s__Time17_2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_4) ).
fof(local_3,axiom,
s__instance(s__Time17_3,s__TimeInterval),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_3) ).
fof(local_5,axiom,
s__temporalPart(s__Time17_2,s__Time17_3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_5) ).
fof(c_0_10,plain,
! [X1386,X1387,X1388] :
( ~ s__instance(X1387,s__SetOrClass)
| ~ s__instance(X1386,s__SetOrClass)
| ~ s__subclass(X1386,X1387)
| ~ s__instance(X1388,X1386)
| s__instance(X1388,X1387) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_27])])]) ).
fof(c_0_11,plain,
! [X1384,X1385] :
( ( s__instance(X1384,s__SetOrClass)
| ~ s__subclass(X1384,X1385) )
& ( s__instance(X1385,s__SetOrClass)
| ~ s__subclass(X1384,X1385) ) ),
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_12,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_10]) ).
cnf(c_0_13,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
( s__instance(X1,X2)
| ~ s__subclass(X3,X2)
| ~ s__instance(X1,X3) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_16,plain,
s__subclass(s__TimeInterval,s__TimePosition),
inference(split_conjunct,[status(thm)],[kb_SUMO_1012]) ).
fof(c_0_17,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_18,plain,
( s__instance(X1,s__TimePosition)
| ~ s__instance(X1,s__TimeInterval) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
s__instance(s__Time17_1,s__TimeInterval),
inference(split_conjunct,[status(thm)],[local_1]) ).
cnf(c_0_20,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_17]) ).
cnf(c_0_21,plain,
s__instance(s__Time17_1,s__TimePosition),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
s__instance(s__Time17_2,s__TimeInterval),
inference(split_conjunct,[status(thm)],[local_2]) ).
fof(c_0_23,negated_conjecture,
~ s__temporalPart(s__Time17_1,s__Time17_3),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[prove_from_SUMO_MILO])]) ).
cnf(c_0_24,plain,
( s__temporalPart(s__Time17_1,X1)
| ~ s__temporalPart(s__Time17_1,X2)
| ~ s__temporalPart(X2,X1)
| ~ s__instance(X2,s__TimePosition)
| ~ s__instance(X1,s__TimePosition) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
s__instance(s__Time17_2,s__TimePosition),
inference(spm,[status(thm)],[c_0_18,c_0_22]) ).
cnf(c_0_26,plain,
s__temporalPart(s__Time17_1,s__Time17_2),
inference(split_conjunct,[status(thm)],[local_4]) ).
cnf(c_0_27,plain,
s__instance(s__Time17_3,s__TimeInterval),
inference(split_conjunct,[status(thm)],[local_3]) ).
fof(c_0_28,negated_conjecture,
~ s__temporalPart(s__Time17_1,s__Time17_3),
inference(fof_nnf,[status(thm)],[c_0_23]) ).
cnf(c_0_29,plain,
( s__temporalPart(s__Time17_1,X1)
| ~ s__temporalPart(s__Time17_2,X1)
| ~ s__instance(X1,s__TimePosition) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_30,plain,
s__instance(s__Time17_3,s__TimePosition),
inference(spm,[status(thm)],[c_0_18,c_0_27]) ).
cnf(c_0_31,plain,
s__temporalPart(s__Time17_2,s__Time17_3),
inference(split_conjunct,[status(thm)],[local_5]) ).
cnf(c_0_32,negated_conjecture,
~ s__temporalPart(s__Time17_1,s__Time17_3),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_33,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CSR090+5 : TPTP v8.2.0. Bugfixed v7.3.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n027.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 01:49:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 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
% 1.52/1.01 # Version: 3.1.0
% 1.52/1.01 # Preprocessing class: FMLLSMSLSSSNFFN.
% 1.52/1.01 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.52/1.01 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.52/1.01 # Starting new_bool_3 with 300s (1) cores
% 1.52/1.01 # Starting new_bool_1 with 300s (1) cores
% 1.52/1.01 # Starting sh5l with 300s (1) cores
% 1.52/1.01 # new_bool_1 with pid 10822 completed with status 0
% 1.52/1.01 # Result found by new_bool_1
% 1.52/1.01 # Preprocessing class: FMLLSMSLSSSNFFN.
% 1.52/1.01 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.52/1.01 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.52/1.01 # Starting new_bool_3 with 300s (1) cores
% 1.52/1.01 # Starting new_bool_1 with 300s (1) cores
% 1.52/1.01 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.52/1.01 # Search class: FGHSF-FSLM31-MFFFFFNN
% 1.52/1.01 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.52/1.01 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 163s (1) cores
% 1.52/1.01 # G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with pid 10824 completed with status 0
% 1.52/1.01 # Result found by G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S
% 1.52/1.01 # Preprocessing class: FMLLSMSLSSSNFFN.
% 1.52/1.01 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.52/1.01 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.52/1.01 # Starting new_bool_3 with 300s (1) cores
% 1.52/1.01 # Starting new_bool_1 with 300s (1) cores
% 1.52/1.01 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.52/1.01 # Search class: FGHSF-FSLM31-MFFFFFNN
% 1.52/1.01 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.52/1.01 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 163s (1) cores
% 1.52/1.01 # Preprocessing time : 0.014 s
% 1.52/1.01 # Presaturation interreduction done
% 1.52/1.01
% 1.52/1.01 # Proof found!
% 1.52/1.01 # SZS status Theorem
% 1.52/1.01 # SZS output start CNFRefutation
% See solution above
% 1.52/1.01 # Parsed axioms : 16754
% 1.52/1.01 # Removed by relevancy pruning/SinE : 16608
% 1.52/1.01 # Initial clauses : 194
% 1.52/1.01 # Removed in clause preprocessing : 4
% 1.52/1.01 # Initial clauses in saturation : 190
% 1.52/1.01 # Processed clauses : 736
% 1.52/1.01 # ...of these trivial : 17
% 1.52/1.01 # ...subsumed : 7
% 1.52/1.01 # ...remaining for further processing : 712
% 1.52/1.01 # Other redundant clauses eliminated : 1
% 1.52/1.01 # Clauses deleted for lack of memory : 0
% 1.52/1.01 # Backward-subsumed : 0
% 1.52/1.01 # Backward-rewritten : 5
% 1.52/1.01 # Generated clauses : 791
% 1.52/1.01 # ...of the previous two non-redundant : 694
% 1.52/1.01 # ...aggressively subsumed : 0
% 1.52/1.01 # Contextual simplify-reflections : 15
% 1.52/1.01 # Paramodulations : 788
% 1.52/1.01 # Factorizations : 0
% 1.52/1.01 # NegExts : 0
% 1.52/1.01 # Equation resolutions : 3
% 1.52/1.01 # Disequality decompositions : 0
% 1.52/1.01 # Total rewrite steps : 149
% 1.52/1.01 # ...of those cached : 73
% 1.52/1.01 # Propositional unsat checks : 0
% 1.52/1.01 # Propositional check models : 0
% 1.52/1.01 # Propositional check unsatisfiable : 0
% 1.52/1.01 # Propositional clauses : 0
% 1.52/1.01 # Propositional clauses after purity: 0
% 1.52/1.01 # Propositional unsat core size : 0
% 1.52/1.01 # Propositional preprocessing time : 0.000
% 1.52/1.01 # Propositional encoding time : 0.000
% 1.52/1.01 # Propositional solver time : 0.000
% 1.52/1.01 # Success case prop preproc time : 0.000
% 1.52/1.01 # Success case prop encoding time : 0.000
% 1.52/1.01 # Success case prop solver time : 0.000
% 1.52/1.01 # Current number of processed clauses : 517
% 1.52/1.01 # Positive orientable unit clauses : 152
% 1.52/1.01 # Positive unorientable unit clauses: 0
% 1.52/1.01 # Negative unit clauses : 27
% 1.52/1.01 # Non-unit-clauses : 338
% 1.52/1.01 # Current number of unprocessed clauses: 332
% 1.52/1.01 # ...number of literals in the above : 932
% 1.52/1.01 # Current number of archived formulas : 0
% 1.52/1.01 # Current number of archived clauses : 194
% 1.52/1.01 # Clause-clause subsumption calls (NU) : 25549
% 1.52/1.01 # Rec. Clause-clause subsumption calls : 7145
% 1.52/1.01 # Non-unit clause-clause subsumptions : 20
% 1.52/1.01 # Unit Clause-clause subsumption calls : 3942
% 1.52/1.01 # Rewrite failures with RHS unbound : 0
% 1.52/1.01 # BW rewrite match attempts : 128
% 1.52/1.01 # BW rewrite match successes : 5
% 1.52/1.01 # Condensation attempts : 0
% 1.52/1.01 # Condensation successes : 0
% 1.52/1.01 # Termbank termtop insertions : 198526
% 1.52/1.01 # Search garbage collected termcells : 89752
% 1.52/1.01
% 1.52/1.01 # -------------------------------------------------
% 1.52/1.01 # User time : 0.141 s
% 1.52/1.01 # System time : 0.063 s
% 1.52/1.01 # Total time : 0.204 s
% 1.52/1.01 # Maximum resident set size: 39724 pages
% 1.52/1.01
% 1.52/1.01 # -------------------------------------------------
% 1.52/1.01 # User time : 0.420 s
% 1.52/1.01 # System time : 0.090 s
% 1.52/1.01 # Total time : 0.510 s
% 1.52/1.01 # Maximum resident set size: 18404 pages
% 1.52/1.01 % E---3.1 exiting
% 1.52/1.01 % E exiting
%------------------------------------------------------------------------------