TSTP Solution File: GEO258+3 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GEO258+3 : TPTP v8.1.2. Released v4.0.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 : Sat May 4 07:45:22 EDT 2024
% Result : Theorem 0.14s 0.40s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 23 ( 6 unt; 0 def)
% Number of atoms : 65 ( 0 equ)
% Maximal formula atoms : 18 ( 2 avg)
% Number of connectives : 69 ( 27 ~; 31 |; 8 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 40 ( 2 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X4,X3,X6,X7] :
( between_on_line(X4,X3,X6,X7)
=> between_on_line(X4,X7,X6,X3) ),
file('/export/starexec/sandbox/tmp/tmp.thdtoSClAn/E---3.1_8323.p',con) ).
fof(a9_defns,axiom,
! [X4,X3,X6,X7] :
( between_on_line(X4,X3,X6,X7)
<=> ( ( before_on_line(X4,X3,X6)
& before_on_line(X4,X6,X7) )
| ( before_on_line(X4,X7,X6)
& before_on_line(X4,X6,X3) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.thdtoSClAn/E---3.1_8323.p',a9_defns) ).
fof(c_0_2,negated_conjecture,
~ ! [X4,X3,X6,X7] :
( between_on_line(X4,X3,X6,X7)
=> between_on_line(X4,X7,X6,X3) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_3,negated_conjecture,
( between_on_line(esk1_0,esk2_0,esk3_0,esk4_0)
& ~ between_on_line(esk1_0,esk4_0,esk3_0,esk2_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).
fof(c_0_4,plain,
! [X13,X14,X15,X16] :
( ( before_on_line(X13,X16,X15)
| before_on_line(X13,X14,X15)
| ~ between_on_line(X13,X14,X15,X16) )
& ( before_on_line(X13,X15,X14)
| before_on_line(X13,X14,X15)
| ~ between_on_line(X13,X14,X15,X16) )
& ( before_on_line(X13,X16,X15)
| before_on_line(X13,X15,X16)
| ~ between_on_line(X13,X14,X15,X16) )
& ( before_on_line(X13,X15,X14)
| before_on_line(X13,X15,X16)
| ~ between_on_line(X13,X14,X15,X16) )
& ( ~ before_on_line(X13,X14,X15)
| ~ before_on_line(X13,X15,X16)
| between_on_line(X13,X14,X15,X16) )
& ( ~ before_on_line(X13,X16,X15)
| ~ before_on_line(X13,X15,X14)
| between_on_line(X13,X14,X15,X16) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a9_defns])])])]) ).
cnf(c_0_5,negated_conjecture,
~ between_on_line(esk1_0,esk4_0,esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
( between_on_line(X1,X2,X3,X4)
| ~ before_on_line(X1,X2,X3)
| ~ before_on_line(X1,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( before_on_line(X1,X2,X3)
| before_on_line(X1,X3,X2)
| ~ between_on_line(X1,X4,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
between_on_line(esk1_0,esk2_0,esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,plain,
( before_on_line(X1,X2,X3)
| before_on_line(X1,X4,X3)
| ~ between_on_line(X1,X4,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,plain,
( between_on_line(X1,X4,X3,X2)
| ~ before_on_line(X1,X2,X3)
| ~ before_on_line(X1,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,negated_conjecture,
( ~ before_on_line(esk1_0,esk3_0,esk2_0)
| ~ before_on_line(esk1_0,esk4_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_12,negated_conjecture,
( before_on_line(esk1_0,esk4_0,esk3_0)
| before_on_line(esk1_0,esk3_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_13,negated_conjecture,
( before_on_line(esk1_0,esk4_0,esk3_0)
| before_on_line(esk1_0,esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_14,negated_conjecture,
( ~ before_on_line(esk1_0,esk3_0,esk4_0)
| ~ before_on_line(esk1_0,esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_5,c_0_10]) ).
cnf(c_0_15,negated_conjecture,
( before_on_line(esk1_0,esk3_0,esk4_0)
| ~ before_on_line(esk1_0,esk3_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( before_on_line(esk1_0,esk2_0,esk3_0)
| ~ before_on_line(esk1_0,esk3_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_13]) ).
cnf(c_0_17,plain,
( before_on_line(X1,X2,X3)
| before_on_line(X1,X3,X2)
| ~ between_on_line(X1,X3,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_18,negated_conjecture,
~ before_on_line(esk1_0,esk3_0,esk2_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_19,negated_conjecture,
before_on_line(esk1_0,esk2_0,esk3_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_8]),c_0_18]) ).
cnf(c_0_20,plain,
( before_on_line(X1,X2,X3)
| before_on_line(X1,X2,X4)
| ~ between_on_line(X1,X3,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_21,negated_conjecture,
~ before_on_line(esk1_0,esk3_0,esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_19])]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_8]),c_0_21]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.08 % Problem : GEO258+3 : TPTP v8.1.2. Released v4.0.0.
% 0.04/0.09 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n019.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Fri May 3 18:44:07 EDT 2024
% 0.09/0.29 % CPUTime :
% 0.14/0.39 Running first-order model finding
% 0.14/0.39 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.thdtoSClAn/E---3.1_8323.p
% 0.14/0.40 # Version: 3.1.0
% 0.14/0.40 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.40 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.40 # Starting sh5l with 300s (1) cores
% 0.14/0.40 # new_bool_3 with pid 8401 completed with status 0
% 0.14/0.40 # Result found by new_bool_3
% 0.14/0.40 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.40 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.40 # Search class: FGUNF-FFSF00-SFFFFFNN
% 0.14/0.40 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.40 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.14/0.40 # SAT001_MinMin_p005000_rr_RG with pid 8404 completed with status 0
% 0.14/0.40 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.14/0.40 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.40 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.40 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.40 # Search class: FGUNF-FFSF00-SFFFFFNN
% 0.14/0.40 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.40 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.14/0.40 # Preprocessing time : 0.001 s
% 0.14/0.40 # Presaturation interreduction done
% 0.14/0.40
% 0.14/0.40 # Proof found!
% 0.14/0.40 # SZS status Theorem
% 0.14/0.40 # SZS output start CNFRefutation
% See solution above
% 0.14/0.40 # Parsed axioms : 37
% 0.14/0.40 # Removed by relevancy pruning/SinE : 35
% 0.14/0.40 # Initial clauses : 8
% 0.14/0.40 # Removed in clause preprocessing : 0
% 0.14/0.40 # Initial clauses in saturation : 8
% 0.14/0.40 # Processed clauses : 27
% 0.14/0.40 # ...of these trivial : 0
% 0.14/0.40 # ...subsumed : 0
% 0.14/0.40 # ...remaining for further processing : 26
% 0.14/0.40 # Other redundant clauses eliminated : 0
% 0.14/0.40 # Clauses deleted for lack of memory : 0
% 0.14/0.40 # Backward-subsumed : 3
% 0.14/0.40 # Backward-rewritten : 2
% 0.14/0.40 # Generated clauses : 18
% 0.14/0.40 # ...of the previous two non-redundant : 11
% 0.14/0.40 # ...aggressively subsumed : 0
% 0.14/0.40 # Contextual simplify-reflections : 1
% 0.14/0.40 # Paramodulations : 17
% 0.14/0.40 # Factorizations : 0
% 0.14/0.40 # NegExts : 0
% 0.14/0.40 # Equation resolutions : 0
% 0.14/0.40 # Disequality decompositions : 0
% 0.14/0.40 # Total rewrite steps : 2
% 0.14/0.40 # ...of those cached : 1
% 0.14/0.40 # Propositional unsat checks : 0
% 0.14/0.40 # Propositional check models : 0
% 0.14/0.40 # Propositional check unsatisfiable : 0
% 0.14/0.40 # Propositional clauses : 0
% 0.14/0.40 # Propositional clauses after purity: 0
% 0.14/0.40 # Propositional unsat core size : 0
% 0.14/0.40 # Propositional preprocessing time : 0.000
% 0.14/0.40 # Propositional encoding time : 0.000
% 0.14/0.40 # Propositional solver time : 0.000
% 0.14/0.40 # Success case prop preproc time : 0.000
% 0.14/0.40 # Success case prop encoding time : 0.000
% 0.14/0.40 # Success case prop solver time : 0.000
% 0.14/0.40 # Current number of processed clauses : 12
% 0.14/0.40 # Positive orientable unit clauses : 3
% 0.14/0.40 # Positive unorientable unit clauses: 0
% 0.14/0.40 # Negative unit clauses : 3
% 0.14/0.40 # Non-unit-clauses : 6
% 0.14/0.40 # Current number of unprocessed clauses: 0
% 0.14/0.40 # ...number of literals in the above : 0
% 0.14/0.40 # Current number of archived formulas : 0
% 0.14/0.40 # Current number of archived clauses : 14
% 0.14/0.40 # Clause-clause subsumption calls (NU) : 35
% 0.14/0.40 # Rec. Clause-clause subsumption calls : 35
% 0.14/0.40 # Non-unit clause-clause subsumptions : 1
% 0.14/0.40 # Unit Clause-clause subsumption calls : 4
% 0.14/0.40 # Rewrite failures with RHS unbound : 0
% 0.14/0.40 # BW rewrite match attempts : 1
% 0.14/0.40 # BW rewrite match successes : 1
% 0.14/0.40 # Condensation attempts : 0
% 0.14/0.40 # Condensation successes : 0
% 0.14/0.40 # Termbank termtop insertions : 1023
% 0.14/0.40 # Search garbage collected termcells : 385
% 0.14/0.40
% 0.14/0.40 # -------------------------------------------------
% 0.14/0.40 # User time : 0.003 s
% 0.14/0.40 # System time : 0.001 s
% 0.14/0.40 # Total time : 0.004 s
% 0.14/0.40 # Maximum resident set size: 1732 pages
% 0.14/0.40
% 0.14/0.40 # -------------------------------------------------
% 0.14/0.40 # User time : 0.004 s
% 0.14/0.40 # System time : 0.003 s
% 0.14/0.40 # Total time : 0.007 s
% 0.14/0.40 # Maximum resident set size: 1744 pages
% 0.14/0.40 % E---3.1 exiting
%------------------------------------------------------------------------------