TSTP Solution File: CSR090+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : CSR090+1 : TPTP v8.1.2. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:36:05 EDT 2024
% Result : Theorem 2.39s 2.37s
% Output : CNFRefutation 2.39s
% 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/tmp/tmp.fOd73Ln5ed/E---3.1_13689.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.fOd73Ln5ed/E---3.1_13689.p',kb_SUMO_26) ).
fof(kb_SUMO_908,axiom,
s__subclass(s__TimeInterval,s__TimePosition),
file('/export/starexec/sandbox/tmp/tmp.fOd73Ln5ed/E---3.1_13689.p',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/sandbox/tmp/tmp.fOd73Ln5ed/E---3.1_13689.p',kb_SUMO_1262) ).
fof(local_1,axiom,
s__instance(s__Time17_1,s__TimeInterval),
file('/export/starexec/sandbox/tmp/tmp.fOd73Ln5ed/E---3.1_13689.p',local_1) ).
fof(local_2,axiom,
s__instance(s__Time17_2,s__TimeInterval),
file('/export/starexec/sandbox/tmp/tmp.fOd73Ln5ed/E---3.1_13689.p',local_2) ).
fof(prove_from_SUMO,conjecture,
s__temporalPart(s__Time17_1,s__Time17_3),
file('/export/starexec/sandbox/tmp/tmp.fOd73Ln5ed/E---3.1_13689.p',prove_from_SUMO) ).
fof(local_4,axiom,
s__temporalPart(s__Time17_1,s__Time17_2),
file('/export/starexec/sandbox/tmp/tmp.fOd73Ln5ed/E---3.1_13689.p',local_4) ).
fof(local_3,axiom,
s__instance(s__Time17_3,s__TimeInterval),
file('/export/starexec/sandbox/tmp/tmp.fOd73Ln5ed/E---3.1_13689.p',local_3) ).
fof(local_5,axiom,
s__temporalPart(s__Time17_2,s__Time17_3),
file('/export/starexec/sandbox/tmp/tmp.fOd73Ln5ed/E---3.1_13689.p',local_5) ).
fof(c_0_10,plain,
! [X667,X668,X669] :
( ~ s__instance(X668,s__SetOrClass)
| ~ s__instance(X667,s__SetOrClass)
| ~ s__subclass(X667,X668)
| ~ s__instance(X669,X667)
| s__instance(X669,X668) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_27])])]) ).
fof(c_0_11,plain,
! [X665,X666] :
( ( s__instance(X665,s__SetOrClass)
| ~ s__subclass(X665,X666) )
& ( s__instance(X666,s__SetOrClass)
| ~ s__subclass(X665,X666) ) ),
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]) ).
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])]) ).
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__temporalPart(s__Time17_1,s__Time17_2),
inference(split_conjunct,[status(thm)],[local_4]) ).
cnf(c_0_26,plain,
s__instance(s__Time17_2,s__TimePosition),
inference(spm,[status(thm)],[c_0_18,c_0_22]) ).
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__temporalPart(s__Time17_2,s__Time17_3),
inference(split_conjunct,[status(thm)],[local_5]) ).
cnf(c_0_31,plain,
s__instance(s__Time17_3,s__TimePosition),
inference(spm,[status(thm)],[c_0_18,c_0_27]) ).
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.11/0.12 % Problem : CSR090+1 : TPTP v8.1.2. Bugfixed v7.3.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n004.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 : Fri May 3 15:10:38 EDT 2024
% 0.13/0.34 % CPUTime :
% 1.93/2.08 Running first-order model finding
% 1.93/2.08 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.fOd73Ln5ed/E---3.1_13689.p
% 2.39/2.37 # Version: 3.1.0
% 2.39/2.37 # Preprocessing class: FMLLSMSLSSSNFFN.
% 2.39/2.37 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.39/2.37 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.39/2.37 # Starting new_bool_3 with 300s (1) cores
% 2.39/2.37 # Starting new_bool_1 with 300s (1) cores
% 2.39/2.37 # Starting sh5l with 300s (1) cores
% 2.39/2.37 # new_bool_1 with pid 13768 completed with status 0
% 2.39/2.37 # Result found by new_bool_1
% 2.39/2.37 # Preprocessing class: FMLLSMSLSSSNFFN.
% 2.39/2.37 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.39/2.37 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.39/2.37 # Starting new_bool_3 with 300s (1) cores
% 2.39/2.37 # Starting new_bool_1 with 300s (1) cores
% 2.39/2.37 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.39/2.37 # Search class: FHHSS-FFMM21-MFFFFFNN
% 2.39/2.37 # partial match(1): FGHSS-FFMM21-MFFFFFNN
% 2.39/2.37 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.39/2.37 # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 2.39/2.37 # G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with pid 13771 completed with status 0
% 2.39/2.37 # Result found by G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN
% 2.39/2.37 # Preprocessing class: FMLLSMSLSSSNFFN.
% 2.39/2.37 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.39/2.37 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.39/2.37 # Starting new_bool_3 with 300s (1) cores
% 2.39/2.37 # Starting new_bool_1 with 300s (1) cores
% 2.39/2.37 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.39/2.37 # Search class: FHHSS-FFMM21-MFFFFFNN
% 2.39/2.37 # partial match(1): FGHSS-FFMM21-MFFFFFNN
% 2.39/2.37 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.39/2.37 # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 2.39/2.37 # Preprocessing time : 0.005 s
% 2.39/2.37 # Presaturation interreduction done
% 2.39/2.37
% 2.39/2.37 # Proof found!
% 2.39/2.37 # SZS status Theorem
% 2.39/2.37 # SZS output start CNFRefutation
% See solution above
% 2.39/2.37 # Parsed axioms : 14793
% 2.39/2.37 # Removed by relevancy pruning/SinE : 14661
% 2.39/2.37 # Initial clauses : 139
% 2.39/2.37 # Removed in clause preprocessing : 4
% 2.39/2.37 # Initial clauses in saturation : 135
% 2.39/2.37 # Processed clauses : 1756
% 2.39/2.37 # ...of these trivial : 78
% 2.39/2.37 # ...subsumed : 688
% 2.39/2.37 # ...remaining for further processing : 990
% 2.39/2.37 # Other redundant clauses eliminated : 1
% 2.39/2.37 # Clauses deleted for lack of memory : 0
% 2.39/2.37 # Backward-subsumed : 0
% 2.39/2.37 # Backward-rewritten : 1
% 2.39/2.37 # Generated clauses : 2008
% 2.39/2.37 # ...of the previous two non-redundant : 1765
% 2.39/2.37 # ...aggressively subsumed : 0
% 2.39/2.37 # Contextual simplify-reflections : 20
% 2.39/2.37 # Paramodulations : 2007
% 2.39/2.37 # Factorizations : 0
% 2.39/2.37 # NegExts : 0
% 2.39/2.37 # Equation resolutions : 1
% 2.39/2.37 # Disequality decompositions : 0
% 2.39/2.37 # Total rewrite steps : 387
% 2.39/2.37 # ...of those cached : 317
% 2.39/2.37 # Propositional unsat checks : 0
% 2.39/2.37 # Propositional check models : 0
% 2.39/2.37 # Propositional check unsatisfiable : 0
% 2.39/2.37 # Propositional clauses : 0
% 2.39/2.37 # Propositional clauses after purity: 0
% 2.39/2.37 # Propositional unsat core size : 0
% 2.39/2.37 # Propositional preprocessing time : 0.000
% 2.39/2.37 # Propositional encoding time : 0.000
% 2.39/2.37 # Propositional solver time : 0.000
% 2.39/2.37 # Success case prop preproc time : 0.000
% 2.39/2.37 # Success case prop encoding time : 0.000
% 2.39/2.37 # Success case prop solver time : 0.000
% 2.39/2.37 # Current number of processed clauses : 860
% 2.39/2.37 # Positive orientable unit clauses : 96
% 2.39/2.37 # Positive unorientable unit clauses: 0
% 2.39/2.37 # Negative unit clauses : 1
% 2.39/2.37 # Non-unit-clauses : 763
% 2.39/2.37 # Current number of unprocessed clauses: 271
% 2.39/2.37 # ...number of literals in the above : 2180
% 2.39/2.37 # Current number of archived formulas : 0
% 2.39/2.37 # Current number of archived clauses : 129
% 2.39/2.37 # Clause-clause subsumption calls (NU) : 172916
% 2.39/2.37 # Rec. Clause-clause subsumption calls : 105269
% 2.39/2.37 # Non-unit clause-clause subsumptions : 708
% 2.39/2.37 # Unit Clause-clause subsumption calls : 364
% 2.39/2.37 # Rewrite failures with RHS unbound : 0
% 2.39/2.37 # BW rewrite match attempts : 4
% 2.39/2.37 # BW rewrite match successes : 1
% 2.39/2.37 # Condensation attempts : 0
% 2.39/2.37 # Condensation successes : 0
% 2.39/2.37 # Termbank termtop insertions : 143320
% 2.39/2.37 # Search garbage collected termcells : 53619
% 2.39/2.37
% 2.39/2.37 # -------------------------------------------------
% 2.39/2.37 # User time : 0.120 s
% 2.39/2.37 # System time : 0.036 s
% 2.39/2.37 # Total time : 0.156 s
% 2.39/2.37 # Maximum resident set size: 20244 pages
% 2.39/2.37
% 2.39/2.37 # -------------------------------------------------
% 2.39/2.37 # User time : 0.229 s
% 2.39/2.37 # System time : 0.046 s
% 2.39/2.37 # Total time : 0.275 s
% 2.39/2.37 # Maximum resident set size: 12668 pages
% 2.39/2.37 % E---3.1 exiting
%------------------------------------------------------------------------------