TSTP Solution File: CSR090+3 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : CSR090+3 : TPTP v8.2.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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 6.99s 4.07s
% Output : CNFRefutation 6.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 33 ( 18 unt; 0 def)
% Number of atoms : 77 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 82 ( 38 ~; 32 |; 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_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(prove_from_ALL,conjecture,
s__temporalPart(s__Time17_1,s__Time17_3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_from_ALL) ).
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(local_4,axiom,
s__temporalPart(s__Time17_1,s__Time17_2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_4) ).
fof(local_5,axiom,
s__temporalPart(s__Time17_2,s__Time17_3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_5) ).
fof(kb_SUMO_27777,axiom,
s__subclass(s__TimeInterval,s__TimePosition),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+2.ax',kb_SUMO_27777) ).
fof(local_3,axiom,
s__instance(s__Time17_3,s__TimeInterval),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_3) ).
fof(local_2,axiom,
s__instance(s__Time17_2,s__TimeInterval),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_2) ).
fof(local_1,axiom,
s__instance(s__Time17_1,s__TimeInterval),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_1) ).
fof(c_0_10,plain,
! [X2378,X2379,X2380] :
( ~ s__instance(X2380,s__TimePosition)
| ~ s__instance(X2379,s__TimePosition)
| ~ s__instance(X2378,s__TimePosition)
| ~ s__temporalPart(X2378,X2379)
| ~ s__temporalPart(X2379,X2380)
| s__temporalPart(X2378,X2380) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_28419])])]) ).
fof(c_0_11,negated_conjecture,
~ s__temporalPart(s__Time17_1,s__Time17_3),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[prove_from_ALL])]) ).
fof(c_0_12,plain,
! [X2417,X2418,X2419] :
( ~ s__instance(X2418,s__SetOrClass)
| ~ s__instance(X2417,s__SetOrClass)
| ~ s__subclass(X2417,X2418)
| ~ s__instance(X2419,X2417)
| s__instance(X2419,X2418) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26636])])]) ).
fof(c_0_13,plain,
! [X2415,X2416] :
( ( s__instance(X2415,s__SetOrClass)
| ~ s__subclass(X2415,X2416) )
& ( s__instance(X2416,s__SetOrClass)
| ~ s__subclass(X2415,X2416) ) ),
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_14,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_10]) ).
cnf(c_0_15,plain,
s__temporalPart(s__Time17_1,s__Time17_2),
inference(split_conjunct,[status(thm)],[local_4]) ).
fof(c_0_16,negated_conjecture,
~ s__temporalPart(s__Time17_1,s__Time17_3),
inference(fof_nnf,[status(thm)],[c_0_11]) ).
cnf(c_0_17,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_18,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( s__temporalPart(s__Time17_1,X1)
| ~ s__temporalPart(s__Time17_2,X1)
| ~ s__instance(s__Time17_1,s__TimePosition)
| ~ s__instance(s__Time17_2,s__TimePosition)
| ~ s__instance(X1,s__TimePosition) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
s__temporalPart(s__Time17_2,s__Time17_3),
inference(split_conjunct,[status(thm)],[local_5]) ).
cnf(c_0_22,negated_conjecture,
~ s__temporalPart(s__Time17_1,s__Time17_3),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
( s__instance(X1,X2)
| ~ s__instance(X1,X3)
| ~ s__subclass(X3,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_24,plain,
s__subclass(s__TimeInterval,s__TimePosition),
inference(split_conjunct,[status(thm)],[kb_SUMO_27777]) ).
cnf(c_0_25,plain,
( ~ s__instance(s__Time17_1,s__TimePosition)
| ~ s__instance(s__Time17_2,s__TimePosition)
| ~ s__instance(s__Time17_3,s__TimePosition) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_26,plain,
( s__instance(X1,s__TimePosition)
| ~ s__instance(X1,s__TimeInterval) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
s__instance(s__Time17_3,s__TimeInterval),
inference(split_conjunct,[status(thm)],[local_3]) ).
cnf(c_0_28,plain,
( ~ s__instance(s__Time17_1,s__TimePosition)
| ~ s__instance(s__Time17_2,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_29,plain,
s__instance(s__Time17_2,s__TimeInterval),
inference(split_conjunct,[status(thm)],[local_2]) ).
cnf(c_0_30,plain,
~ s__instance(s__Time17_1,s__TimePosition),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_26]),c_0_29])]) ).
cnf(c_0_31,plain,
s__instance(s__Time17_1,s__TimeInterval),
inference(split_conjunct,[status(thm)],[local_1]) ).
cnf(c_0_32,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_26]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : CSR090+3 : TPTP v8.2.0. Bugfixed v7.3.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.16/0.37 % Computer : n018.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Sun May 19 02:11:38 EDT 2024
% 0.16/0.38 % CPUTime :
% 0.23/0.51 Running first-order model finding
% 0.23/0.52 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
% 6.99/4.07 # Version: 3.1.0
% 6.99/4.07 # Preprocessing class: FLLLSMSLSSSNFFN.
% 6.99/4.07 # Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 6.99/4.07 # Starting G-E--_300_C01_S5PRR_S00 with 1490s (5) cores
% 6.99/4.07 # Starting new_bool_3 with 298s (1) cores
% 6.99/4.07 # Starting new_bool_1 with 298s (1) cores
% 6.99/4.07 # Starting sh5l with 298s (1) cores
% 6.99/4.07 # new_bool_3 with pid 10017 completed with status 0
% 6.99/4.07 # Result found by new_bool_3
% 6.99/4.07 # Preprocessing class: FLLLSMSLSSSNFFN.
% 6.99/4.07 # Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 6.99/4.07 # Starting G-E--_300_C01_S5PRR_S00 with 1490s (5) cores
% 6.99/4.07 # Starting new_bool_3 with 298s (1) cores
% 6.99/4.07 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 6.99/4.07 # Search class: FGHSM-FSLM32-MFFFFFNN
% 6.99/4.07 # Scheduled 12 strats onto 1 cores with 298 seconds (298 total)
% 6.99/4.07 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 6.99/4.07 # G-E--_303_C18_F1_URBAN_S0Y with pid 10020 completed with status 0
% 6.99/4.07 # Result found by G-E--_303_C18_F1_URBAN_S0Y
% 6.99/4.07 # Preprocessing class: FLLLSMSLSSSNFFN.
% 6.99/4.07 # Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 6.99/4.07 # Starting G-E--_300_C01_S5PRR_S00 with 1490s (5) cores
% 6.99/4.07 # Starting new_bool_3 with 298s (1) cores
% 6.99/4.07 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 6.99/4.07 # Search class: FGHSM-FSLM32-MFFFFFNN
% 6.99/4.07 # Scheduled 12 strats onto 1 cores with 298 seconds (298 total)
% 6.99/4.07 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 6.99/4.07 # Preprocessing time : 0.031 s
% 6.99/4.07
% 6.99/4.07 # Proof found!
% 6.99/4.07 # SZS status Theorem
% 6.99/4.07 # SZS output start CNFRefutation
% See solution above
% 6.99/4.07 # Parsed axioms : 145107
% 6.99/4.07 # Removed by relevancy pruning/SinE : 144612
% 6.99/4.07 # Initial clauses : 624
% 6.99/4.07 # Removed in clause preprocessing : 18
% 6.99/4.07 # Initial clauses in saturation : 606
% 6.99/4.07 # Processed clauses : 998
% 6.99/4.07 # ...of these trivial : 82
% 6.99/4.07 # ...subsumed : 31
% 6.99/4.07 # ...remaining for further processing : 885
% 6.99/4.07 # Other redundant clauses eliminated : 3
% 6.99/4.07 # Clauses deleted for lack of memory : 0
% 6.99/4.07 # Backward-subsumed : 14
% 6.99/4.07 # Backward-rewritten : 87
% 6.99/4.07 # Generated clauses : 4711
% 6.99/4.07 # ...of the previous two non-redundant : 4592
% 6.99/4.07 # ...aggressively subsumed : 0
% 6.99/4.07 # Contextual simplify-reflections : 46
% 6.99/4.07 # Paramodulations : 4707
% 6.99/4.07 # Factorizations : 0
% 6.99/4.07 # NegExts : 0
% 6.99/4.07 # Equation resolutions : 4
% 6.99/4.07 # Disequality decompositions : 0
% 6.99/4.07 # Total rewrite steps : 322
% 6.99/4.07 # ...of those cached : 201
% 6.99/4.07 # Propositional unsat checks : 0
% 6.99/4.07 # Propositional check models : 0
% 6.99/4.07 # Propositional check unsatisfiable : 0
% 6.99/4.07 # Propositional clauses : 0
% 6.99/4.07 # Propositional clauses after purity: 0
% 6.99/4.07 # Propositional unsat core size : 0
% 6.99/4.07 # Propositional preprocessing time : 0.000
% 6.99/4.07 # Propositional encoding time : 0.000
% 6.99/4.07 # Propositional solver time : 0.000
% 6.99/4.07 # Success case prop preproc time : 0.000
% 6.99/4.07 # Success case prop encoding time : 0.000
% 6.99/4.07 # Success case prop solver time : 0.000
% 6.99/4.07 # Current number of processed clauses : 783
% 6.99/4.07 # Positive orientable unit clauses : 273
% 6.99/4.07 # Positive unorientable unit clauses: 0
% 6.99/4.07 # Negative unit clauses : 2
% 6.99/4.07 # Non-unit-clauses : 508
% 6.99/4.07 # Current number of unprocessed clauses: 2729
% 6.99/4.07 # ...number of literals in the above : 15521
% 6.99/4.07 # Current number of archived formulas : 0
% 6.99/4.07 # Current number of archived clauses : 101
% 6.99/4.07 # Clause-clause subsumption calls (NU) : 55273
% 6.99/4.07 # Rec. Clause-clause subsumption calls : 8561
% 6.99/4.07 # Non-unit clause-clause subsumptions : 85
% 6.99/4.07 # Unit Clause-clause subsumption calls : 3971
% 6.99/4.07 # Rewrite failures with RHS unbound : 0
% 6.99/4.07 # BW rewrite match attempts : 240
% 6.99/4.07 # BW rewrite match successes : 53
% 6.99/4.07 # Condensation attempts : 0
% 6.99/4.07 # Condensation successes : 0
% 6.99/4.07 # Termbank termtop insertions : 1105878
% 6.99/4.07 # Search garbage collected termcells : 464599
% 6.99/4.07
% 6.99/4.07 # -------------------------------------------------
% 6.99/4.07 # User time : 0.561 s
% 6.99/4.07 # System time : 0.176 s
% 6.99/4.07 # Total time : 0.737 s
% 6.99/4.07 # Maximum resident set size: 172712 pages
% 6.99/4.07
% 6.99/4.07 # -------------------------------------------------
% 6.99/4.07 # User time : 3.179 s
% 6.99/4.07 # System time : 0.267 s
% 6.99/4.07 # Total time : 3.446 s
% 6.99/4.07 # Maximum resident set size: 98072 pages
% 6.99/4.07 % E---3.1 exiting
%------------------------------------------------------------------------------