TSTP Solution File: CSR090+6 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : CSR090+6 : TPTP v8.2.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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:23 EDT 2024
% Result : Theorem 5.10s 3.24s
% Output : CNFRefutation 5.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 33 ( 20 unt; 0 def)
% Number of atoms : 72 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 69 ( 30 ~; 27 |; 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 : 31 ( 2 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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(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_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(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_ALL,conjecture,
s__temporalPart(s__Time17_1,s__Time17_3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_from_ALL) ).
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,
! [X2522,X2523,X2524] :
( ~ s__instance(X2523,s__SetOrClass)
| ~ s__instance(X2522,s__SetOrClass)
| ~ s__subclass(X2522,X2523)
| ~ s__instance(X2524,X2522)
| s__instance(X2524,X2523) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26636])])]) ).
fof(c_0_11,plain,
! [X2520,X2521] :
( ( s__instance(X2520,s__SetOrClass)
| ~ s__subclass(X2520,X2521) )
& ( s__instance(X2521,s__SetOrClass)
| ~ s__subclass(X2520,X2521) ) ),
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_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__instance(X1,X3)
| ~ s__subclass(X3,X2) ),
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_27777]) ).
fof(c_0_17,plain,
! [X2350,X2351,X2352] :
( ~ s__instance(X2352,s__TimePosition)
| ~ s__instance(X2351,s__TimePosition)
| ~ s__instance(X2350,s__TimePosition)
| ~ s__temporalPart(X2350,X2351)
| ~ s__temporalPart(X2351,X2352)
| s__temporalPart(X2350,X2352) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_28419])])]) ).
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__instance(s__Time17_2,s__TimeInterval),
inference(split_conjunct,[status(thm)],[local_2]) ).
fof(c_0_21,negated_conjecture,
~ s__temporalPart(s__Time17_1,s__Time17_3),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[prove_from_ALL])]) ).
cnf(c_0_22,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_23,plain,
s__temporalPart(s__Time17_1,s__Time17_2),
inference(split_conjunct,[status(thm)],[local_4]) ).
cnf(c_0_24,plain,
s__instance(s__Time17_1,s__TimePosition),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
s__instance(s__Time17_2,s__TimePosition),
inference(spm,[status(thm)],[c_0_18,c_0_20]) ).
cnf(c_0_26,plain,
s__instance(s__Time17_3,s__TimeInterval),
inference(split_conjunct,[status(thm)],[local_3]) ).
fof(c_0_27,negated_conjecture,
~ s__temporalPart(s__Time17_1,s__Time17_3),
inference(fof_nnf,[status(thm)],[c_0_21]) ).
cnf(c_0_28,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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25])]) ).
cnf(c_0_29,plain,
s__temporalPart(s__Time17_2,s__Time17_3),
inference(split_conjunct,[status(thm)],[local_5]) ).
cnf(c_0_30,plain,
s__instance(s__Time17_3,s__TimePosition),
inference(spm,[status(thm)],[c_0_18,c_0_26]) ).
cnf(c_0_31,negated_conjecture,
~ s__temporalPart(s__Time17_1,s__Time17_3),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_32,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : CSR090+6 : TPTP v8.2.0. Bugfixed v7.3.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n003.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 01:49:08 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.17/0.45 Running first-order model finding
% 0.17/0.45 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/benchmark/theBenchmark.p
% 5.10/3.24 # Version: 3.1.0
% 5.10/3.24 # Preprocessing class: FMLLSMSLSSSNFFN.
% 5.10/3.24 # Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 5.10/3.24 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1490s (5) cores
% 5.10/3.24 # Starting new_bool_3 with 298s (1) cores
% 5.10/3.24 # Starting new_bool_1 with 298s (1) cores
% 5.10/3.24 # Starting sh5l with 298s (1) cores
% 5.10/3.24 # new_bool_3 with pid 25266 completed with status 0
% 5.10/3.24 # Result found by new_bool_3
% 5.10/3.24 # Preprocessing class: FMLLSMSLSSSNFFN.
% 5.10/3.24 # Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 5.10/3.24 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1490s (5) cores
% 5.10/3.24 # Starting new_bool_3 with 298s (1) cores
% 5.10/3.24 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.10/3.24 # Search class: FGHSS-FSLM31-MFFFFFNN
% 5.10/3.24 # partial match(1): FGHSM-FSLM31-MFFFFFNN
% 5.10/3.24 # Scheduled 7 strats onto 1 cores with 298 seconds (298 total)
% 5.10/3.24 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 135s (1) cores
% 5.10/3.24 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 25270 completed with status 0
% 5.10/3.24 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 5.10/3.24 # Preprocessing class: FMLLSMSLSSSNFFN.
% 5.10/3.24 # Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 5.10/3.24 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1490s (5) cores
% 5.10/3.24 # Starting new_bool_3 with 298s (1) cores
% 5.10/3.24 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.10/3.24 # Search class: FGHSS-FSLM31-MFFFFFNN
% 5.10/3.24 # partial match(1): FGHSM-FSLM31-MFFFFFNN
% 5.10/3.24 # Scheduled 7 strats onto 1 cores with 298 seconds (298 total)
% 5.10/3.24 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 135s (1) cores
% 5.10/3.24 # Preprocessing time : 0.026 s
% 5.10/3.24 # Presaturation interreduction done
% 5.10/3.24
% 5.10/3.24 # Proof found!
% 5.10/3.24 # SZS status Theorem
% 5.10/3.24 # SZS output start CNFRefutation
% See solution above
% 5.10/3.24 # Parsed axioms : 55592
% 5.10/3.24 # Removed by relevancy pruning/SinE : 55419
% 5.10/3.24 # Initial clauses : 221
% 5.10/3.24 # Removed in clause preprocessing : 8
% 5.10/3.24 # Initial clauses in saturation : 213
% 5.10/3.24 # Processed clauses : 919
% 5.10/3.24 # ...of these trivial : 39
% 5.10/3.24 # ...subsumed : 2
% 5.10/3.24 # ...remaining for further processing : 878
% 5.10/3.24 # Other redundant clauses eliminated : 3
% 5.10/3.24 # Clauses deleted for lack of memory : 0
% 5.10/3.24 # Backward-subsumed : 1
% 5.10/3.24 # Backward-rewritten : 9
% 5.10/3.24 # Generated clauses : 1188
% 5.10/3.24 # ...of the previous two non-redundant : 907
% 5.10/3.24 # ...aggressively subsumed : 0
% 5.10/3.24 # Contextual simplify-reflections : 23
% 5.10/3.24 # Paramodulations : 1184
% 5.10/3.24 # Factorizations : 0
% 5.10/3.24 # NegExts : 0
% 5.10/3.24 # Equation resolutions : 4
% 5.10/3.24 # Disequality decompositions : 0
% 5.10/3.24 # Total rewrite steps : 802
% 5.10/3.24 # ...of those cached : 617
% 5.10/3.24 # Propositional unsat checks : 0
% 5.10/3.24 # Propositional check models : 0
% 5.10/3.24 # Propositional check unsatisfiable : 0
% 5.10/3.24 # Propositional clauses : 0
% 5.10/3.24 # Propositional clauses after purity: 0
% 5.10/3.24 # Propositional unsat core size : 0
% 5.10/3.24 # Propositional preprocessing time : 0.000
% 5.10/3.24 # Propositional encoding time : 0.000
% 5.10/3.24 # Propositional solver time : 0.000
% 5.10/3.24 # Success case prop preproc time : 0.000
% 5.10/3.24 # Success case prop encoding time : 0.000
% 5.10/3.24 # Success case prop solver time : 0.000
% 5.10/3.24 # Current number of processed clauses : 655
% 5.10/3.24 # Positive orientable unit clauses : 347
% 5.10/3.24 # Positive unorientable unit clauses: 0
% 5.10/3.24 # Negative unit clauses : 1
% 5.10/3.24 # Non-unit-clauses : 307
% 5.10/3.24 # Current number of unprocessed clauses: 411
% 5.10/3.24 # ...number of literals in the above : 962
% 5.10/3.24 # Current number of archived formulas : 0
% 5.10/3.24 # Current number of archived clauses : 220
% 5.10/3.24 # Clause-clause subsumption calls (NU) : 25506
% 5.10/3.24 # Rec. Clause-clause subsumption calls : 4844
% 5.10/3.24 # Non-unit clause-clause subsumptions : 26
% 5.10/3.24 # Unit Clause-clause subsumption calls : 6722
% 5.10/3.24 # Rewrite failures with RHS unbound : 0
% 5.10/3.24 # BW rewrite match attempts : 7
% 5.10/3.24 # BW rewrite match successes : 3
% 5.10/3.24 # Condensation attempts : 0
% 5.10/3.24 # Condensation successes : 0
% 5.10/3.24 # Termbank termtop insertions : 689412
% 5.10/3.24 # Search garbage collected termcells : 293653
% 5.10/3.24
% 5.10/3.24 # -------------------------------------------------
% 5.10/3.24 # User time : 0.373 s
% 5.10/3.24 # System time : 0.170 s
% 5.10/3.24 # Total time : 0.543 s
% 5.10/3.24 # Maximum resident set size: 131740 pages
% 5.10/3.24
% 5.10/3.24 # -------------------------------------------------
% 5.10/3.24 # User time : 2.458 s
% 5.10/3.24 # System time : 0.262 s
% 5.10/3.24 # Total time : 2.721 s
% 5.10/3.24 # Maximum resident set size: 57428 pages
% 5.10/3.24 % E---3.1 exiting
%------------------------------------------------------------------------------