TSTP Solution File: CSR090+4 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : CSR090+4 : TPTP v8.2.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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:18:22 EDT 2024
% Result : Theorem 0.65s 0.69s
% Output : CNFRefutation 0.65s
% 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/sandbox2/benchmark/Axioms/CSR003+0.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/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_26) ).
fof(kb_SUMO_908,axiom,
s__subclass(s__TimeInterval,s__TimePosition),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_908) ).
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/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_1262) ).
fof(local_1,axiom,
s__instance(s__Time17_1,s__TimeInterval),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_1) ).
fof(prove_from_SUMO,conjecture,
s__temporalPart(s__Time17_1,s__Time17_3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_from_SUMO) ).
fof(local_2,axiom,
s__instance(s__Time17_2,s__TimeInterval),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_2) ).
fof(local_4,axiom,
s__temporalPart(s__Time17_1,s__Time17_2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_4) ).
fof(local_3,axiom,
s__instance(s__Time17_3,s__TimeInterval),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_3) ).
fof(local_5,axiom,
s__temporalPart(s__Time17_2,s__Time17_3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_5) ).
fof(c_0_10,plain,
! [X649,X650,X651] :
( ~ s__instance(X650,s__SetOrClass)
| ~ s__instance(X649,s__SetOrClass)
| ~ s__subclass(X649,X650)
| ~ s__instance(X651,X649)
| s__instance(X651,X650) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_27])])]) ).
fof(c_0_11,plain,
! [X647,X648] :
( ( s__instance(X647,s__SetOrClass)
| ~ s__subclass(X647,X648) )
& ( s__instance(X648,s__SetOrClass)
| ~ s__subclass(X647,X648) ) ),
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_908]) ).
fof(c_0_17,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_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]) ).
fof(c_0_20,negated_conjecture,
~ s__temporalPart(s__Time17_1,s__Time17_3),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[prove_from_SUMO])]) ).
cnf(c_0_21,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_22,plain,
s__instance(s__Time17_1,s__TimePosition),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
s__instance(s__Time17_2,s__TimeInterval),
inference(split_conjunct,[status(thm)],[local_2]) ).
fof(c_0_24,negated_conjecture,
~ s__temporalPart(s__Time17_1,s__Time17_3),
inference(fof_nnf,[status(thm)],[c_0_20]) ).
cnf(c_0_25,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_21,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_2,s__TimePosition),
inference(spm,[status(thm)],[c_0_18,c_0_23]) ).
cnf(c_0_28,plain,
s__instance(s__Time17_3,s__TimeInterval),
inference(split_conjunct,[status(thm)],[local_3]) ).
cnf(c_0_29,negated_conjecture,
~ s__temporalPart(s__Time17_1,s__Time17_3),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,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_25,c_0_26]),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,plain,
s__instance(s__Time17_3,s__TimePosition),
inference(spm,[status(thm)],[c_0_18,c_0_28]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[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.07/0.12 % Problem : CSR090+4 : TPTP v8.2.0. Bugfixed v7.3.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 01:09:23 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.65/0.69 # Version: 3.1.0
% 0.65/0.69 # Preprocessing class: FMLLSMSLSSSNFFN.
% 0.65/0.69 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.65/0.69 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.65/0.69 # Starting new_bool_3 with 300s (1) cores
% 0.65/0.69 # Starting new_bool_1 with 300s (1) cores
% 0.65/0.69 # Starting sh5l with 300s (1) cores
% 0.65/0.69 # new_bool_1 with pid 1767 completed with status 0
% 0.65/0.69 # Result found by new_bool_1
% 0.65/0.69 # Preprocessing class: FMLLSMSLSSSNFFN.
% 0.65/0.69 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.65/0.69 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.65/0.69 # Starting new_bool_3 with 300s (1) cores
% 0.65/0.69 # Starting new_bool_1 with 300s (1) cores
% 0.65/0.69 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.65/0.69 # Search class: FHHSF-FFMM21-MFFFFFNN
% 0.65/0.69 # partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.65/0.69 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.65/0.69 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.65/0.69 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1771 completed with status 0
% 0.65/0.69 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.65/0.69 # Preprocessing class: FMLLSMSLSSSNFFN.
% 0.65/0.69 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.65/0.69 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.65/0.69 # Starting new_bool_3 with 300s (1) cores
% 0.65/0.69 # Starting new_bool_1 with 300s (1) cores
% 0.65/0.69 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.65/0.69 # Search class: FHHSF-FFMM21-MFFFFFNN
% 0.65/0.69 # partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.65/0.69 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.65/0.69 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.65/0.69 # Preprocessing time : 0.005 s
% 0.65/0.69 # Presaturation interreduction done
% 0.65/0.69
% 0.65/0.69 # Proof found!
% 0.65/0.69 # SZS status Theorem
% 0.65/0.69 # SZS output start CNFRefutation
% See solution above
% 0.65/0.69 # Parsed axioms : 7223
% 0.65/0.69 # Removed by relevancy pruning/SinE : 7180
% 0.65/0.69 # Initial clauses : 50
% 0.65/0.69 # Removed in clause preprocessing : 4
% 0.65/0.69 # Initial clauses in saturation : 46
% 0.65/0.69 # Processed clauses : 134
% 0.65/0.69 # ...of these trivial : 1
% 0.65/0.69 # ...subsumed : 9
% 0.65/0.69 # ...remaining for further processing : 124
% 0.65/0.69 # Other redundant clauses eliminated : 1
% 0.65/0.69 # Clauses deleted for lack of memory : 0
% 0.65/0.69 # Backward-subsumed : 0
% 0.65/0.69 # Backward-rewritten : 0
% 0.65/0.69 # Generated clauses : 87
% 0.65/0.69 # ...of the previous two non-redundant : 68
% 0.65/0.69 # ...aggressively subsumed : 0
% 0.65/0.69 # Contextual simplify-reflections : 13
% 0.65/0.69 # Paramodulations : 86
% 0.65/0.69 # Factorizations : 0
% 0.65/0.69 # NegExts : 0
% 0.65/0.69 # Equation resolutions : 1
% 0.65/0.69 # Disequality decompositions : 0
% 0.65/0.69 # Total rewrite steps : 19
% 0.65/0.69 # ...of those cached : 12
% 0.65/0.69 # Propositional unsat checks : 0
% 0.65/0.69 # Propositional check models : 0
% 0.65/0.69 # Propositional check unsatisfiable : 0
% 0.65/0.69 # Propositional clauses : 0
% 0.65/0.69 # Propositional clauses after purity: 0
% 0.65/0.69 # Propositional unsat core size : 0
% 0.65/0.69 # Propositional preprocessing time : 0.000
% 0.65/0.69 # Propositional encoding time : 0.000
% 0.65/0.69 # Propositional solver time : 0.000
% 0.65/0.69 # Success case prop preproc time : 0.000
% 0.65/0.69 # Success case prop encoding time : 0.000
% 0.65/0.69 # Success case prop solver time : 0.000
% 0.65/0.69 # Current number of processed clauses : 77
% 0.65/0.69 # Positive orientable unit clauses : 16
% 0.65/0.69 # Positive unorientable unit clauses: 0
% 0.65/0.69 # Negative unit clauses : 1
% 0.65/0.69 # Non-unit-clauses : 60
% 0.65/0.69 # Current number of unprocessed clauses: 26
% 0.65/0.69 # ...number of literals in the above : 158
% 0.65/0.69 # Current number of archived formulas : 0
% 0.65/0.69 # Current number of archived clauses : 46
% 0.65/0.69 # Clause-clause subsumption calls (NU) : 829
% 0.65/0.69 # Rec. Clause-clause subsumption calls : 381
% 0.65/0.69 # Non-unit clause-clause subsumptions : 22
% 0.65/0.69 # Unit Clause-clause subsumption calls : 5
% 0.65/0.69 # Rewrite failures with RHS unbound : 0
% 0.65/0.69 # BW rewrite match attempts : 0
% 0.65/0.69 # BW rewrite match successes : 0
% 0.65/0.69 # Condensation attempts : 0
% 0.65/0.69 # Condensation successes : 0
% 0.65/0.69 # Termbank termtop insertions : 82871
% 0.65/0.69 # Search garbage collected termcells : 39596
% 0.65/0.69
% 0.65/0.69 # -------------------------------------------------
% 0.65/0.69 # User time : 0.036 s
% 0.65/0.69 # System time : 0.020 s
% 0.65/0.69 # Total time : 0.056 s
% 0.65/0.69 # Maximum resident set size: 16576 pages
% 0.65/0.69
% 0.65/0.69 # -------------------------------------------------
% 0.65/0.69 # User time : 0.178 s
% 0.65/0.69 # System time : 0.033 s
% 0.65/0.69 # Total time : 0.211 s
% 0.65/0.69 # Maximum resident set size: 9056 pages
% 0.65/0.69 % E---3.1 exiting
%------------------------------------------------------------------------------