TSTP Solution File: GEO188+2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GEO188+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:34:15 EDT 2023
% Result : Timeout 0.33s 300.13s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 6
% Syntax : Number of formulae : 38 ( 11 unt; 0 def)
% Number of atoms : 112 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 102 ( 28 ~; 54 |; 13 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 66 ( 0 sgn; 35 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2,X3] :
( ( distinct_points(X1,X2)
& distinct_points(X1,X3)
& distinct_points(X2,X3)
& ~ apart_point_and_line(X3,line_connecting(X1,X2)) )
=> ~ apart_point_and_line(X1,line_connecting(X3,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.8lBTcBXS3m/E---3.1_26109.p',con) ).
fof(apart4,axiom,
! [X1,X2,X3] :
( distinct_points(X1,X2)
=> ( distinct_points(X1,X3)
| distinct_points(X2,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.8lBTcBXS3m/E---3.1_26109.p',apart4) ).
fof(apart1,axiom,
! [X1] : ~ distinct_points(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.8lBTcBXS3m/E---3.1_26109.p',apart1) ).
fof(ceq2,axiom,
! [X1,X2,X3] :
( apart_point_and_line(X1,X2)
=> ( distinct_lines(X2,X3)
| apart_point_and_line(X1,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.8lBTcBXS3m/E---3.1_26109.p',ceq2) ).
fof(cu1,axiom,
! [X1,X2,X4,X5] :
( ( distinct_points(X1,X2)
& distinct_lines(X4,X5) )
=> ( apart_point_and_line(X1,X4)
| apart_point_and_line(X1,X5)
| apart_point_and_line(X2,X4)
| apart_point_and_line(X2,X5) ) ),
file('/export/starexec/sandbox2/tmp/tmp.8lBTcBXS3m/E---3.1_26109.p',cu1) ).
fof(con1,axiom,
! [X1,X2,X3] :
( distinct_points(X1,X2)
=> ( apart_point_and_line(X3,line_connecting(X1,X2))
=> ( distinct_points(X3,X1)
& distinct_points(X3,X2) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.8lBTcBXS3m/E---3.1_26109.p',con1) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2,X3] :
( ( distinct_points(X1,X2)
& distinct_points(X1,X3)
& distinct_points(X2,X3)
& ~ apart_point_and_line(X3,line_connecting(X1,X2)) )
=> ~ apart_point_and_line(X1,line_connecting(X3,X2)) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[con])]) ).
fof(c_0_7,plain,
! [X9,X10,X11] :
( ~ distinct_points(X9,X10)
| distinct_points(X9,X11)
| distinct_points(X10,X11) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[apart4])]) ).
fof(c_0_8,negated_conjecture,
( distinct_points(esk1_0,esk2_0)
& distinct_points(esk1_0,esk3_0)
& distinct_points(esk2_0,esk3_0)
& ~ apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0))
& apart_point_and_line(esk1_0,line_connecting(esk3_0,esk2_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_9,plain,
! [X1] : ~ distinct_points(X1,X1),
inference(fof_simplification,[status(thm)],[apart1]) ).
cnf(c_0_10,plain,
( distinct_points(X1,X3)
| distinct_points(X2,X3)
| ~ distinct_points(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
distinct_points(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X6] : ~ distinct_points(X6,X6),
inference(variable_rename,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
( distinct_points(esk2_0,X1)
| distinct_points(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
~ distinct_points(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,negated_conjecture,
( distinct_points(esk2_0,X1)
| distinct_points(esk3_0,X2)
| distinct_points(X1,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_13]) ).
fof(c_0_16,plain,
! [X31,X32,X33] :
( ~ apart_point_and_line(X31,X32)
| distinct_lines(X32,X33)
| apart_point_and_line(X31,X33) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq2])]) ).
cnf(c_0_17,negated_conjecture,
( distinct_points(X1,esk3_0)
| distinct_points(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
fof(c_0_18,plain,
! [X24,X25,X26,X27] :
( ~ distinct_points(X24,X25)
| ~ distinct_lines(X26,X27)
| apart_point_and_line(X24,X26)
| apart_point_and_line(X24,X27)
| apart_point_and_line(X25,X26)
| apart_point_and_line(X25,X27) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cu1])]) ).
cnf(c_0_19,plain,
( distinct_lines(X2,X3)
| apart_point_and_line(X1,X3)
| ~ apart_point_and_line(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,negated_conjecture,
apart_point_and_line(esk1_0,line_connecting(esk3_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_21,negated_conjecture,
( distinct_points(X1,esk3_0)
| distinct_points(esk2_0,X2)
| distinct_points(X1,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_17]) ).
cnf(c_0_22,plain,
( apart_point_and_line(X1,X3)
| apart_point_and_line(X1,X4)
| apart_point_and_line(X2,X3)
| apart_point_and_line(X2,X4)
| ~ distinct_points(X1,X2)
| ~ distinct_lines(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,negated_conjecture,
( apart_point_and_line(esk1_0,X1)
| distinct_lines(line_connecting(esk3_0,esk2_0),X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
( distinct_points(X1,esk2_0)
| distinct_points(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_14,c_0_21]) ).
fof(c_0_25,plain,
! [X18,X19,X20] :
( ( distinct_points(X20,X18)
| ~ apart_point_and_line(X20,line_connecting(X18,X19))
| ~ distinct_points(X18,X19) )
& ( distinct_points(X20,X19)
| ~ apart_point_and_line(X20,line_connecting(X18,X19))
| ~ distinct_points(X18,X19) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[con1])])]) ).
cnf(c_0_26,negated_conjecture,
( apart_point_and_line(X1,line_connecting(esk3_0,esk2_0))
| apart_point_and_line(X2,line_connecting(esk3_0,esk2_0))
| apart_point_and_line(esk1_0,X3)
| apart_point_and_line(X1,X3)
| apart_point_and_line(X2,X3)
| ~ distinct_points(X1,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
distinct_points(esk3_0,esk2_0),
inference(spm,[status(thm)],[c_0_14,c_0_24]) ).
cnf(c_0_28,plain,
( distinct_points(X1,X2)
| ~ apart_point_and_line(X1,line_connecting(X2,X3))
| ~ distinct_points(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_29,negated_conjecture,
( apart_point_and_line(esk2_0,line_connecting(esk3_0,esk2_0))
| apart_point_and_line(esk3_0,line_connecting(esk3_0,esk2_0))
| apart_point_and_line(esk2_0,X1)
| apart_point_and_line(esk3_0,X1)
| apart_point_and_line(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
( distinct_points(X1,X2)
| ~ apart_point_and_line(X1,line_connecting(X3,X2))
| ~ distinct_points(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,negated_conjecture,
( apart_point_and_line(esk2_0,line_connecting(esk3_0,esk2_0))
| apart_point_and_line(esk1_0,X1)
| apart_point_and_line(esk3_0,X1)
| apart_point_and_line(esk2_0,X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_27])]),c_0_14]) ).
cnf(c_0_32,negated_conjecture,
~ apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_33,negated_conjecture,
( apart_point_and_line(esk2_0,X1)
| apart_point_and_line(esk3_0,X1)
| apart_point_and_line(esk1_0,X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_27])]),c_0_14]) ).
cnf(c_0_34,negated_conjecture,
( apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_35,negated_conjecture,
distinct_points(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_36,negated_conjecture,
apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_34]),c_0_35])]),c_0_14]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_36]),c_0_35])]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : GEO188+2 : TPTP v8.1.2. Released v3.3.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.10/0.32 % Computer : n015.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 2400
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Tue Oct 3 07:12:16 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.17/0.43 Running first-order model finding
% 0.17/0.43 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/tmp/tmp.8lBTcBXS3m/E---3.1_26109.p
% 0.33/300.13 # Version: 3.1pre001
% 0.33/300.13 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.33/300.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/300.13 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.33/300.13 # Starting new_bool_3 with 300s (1) cores
% 0.33/300.13 # Starting new_bool_1 with 300s (1) cores
% 0.33/300.13 # Starting sh5l with 300s (1) cores
% 0.33/300.13 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 26187 completed with status 0
% 0.33/300.13 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.33/300.13 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.33/300.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/300.13 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.33/300.13 # No SInE strategy applied
% 0.33/300.13 # Search class: FGUNF-FFSS22-SFFFFFNN
% 0.33/300.13 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.33/300.13 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.33/300.13 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.33/300.13 # Starting new_bool_3 with 136s (1) cores
% 0.33/300.13 # Starting new_bool_1 with 136s (1) cores
% 0.33/300.13 # Starting sh5l with 136s (1) cores
% 0.33/300.13 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 26193 completed with status 0
% 0.33/300.13 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.33/300.13 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.33/300.13 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/300.13 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.33/300.13 # No SInE strategy applied
% 0.33/300.13 # Search class: FGUNF-FFSS22-SFFFFFNN
% 0.33/300.13 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.33/300.13 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.33/300.13 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.33/300.13 # Preprocessing time : 0.001 s
% 0.33/300.13 # Presaturation interreduction done
% 0.33/300.13
% 0.33/300.13 # Proof found!
% 0.33/300.13 # SZS status Theorem
% 0.33/300.13 # SZS output start CNFRefutation
% See solution above
% 0.33/300.13 # Parsed axioms : 13
% 0.33/300.13 # Removed by relevancy pruning/SinE : 0
% 0.33/300.13 # Initial clauses : 19
% 0.33/300.13 # Removed in clause preprocessing : 0
% 0.33/300.13 # Initial clauses in saturation : 19
% 0.33/300.13 # Processed clauses : 134
% 0.33/300.13 # ...of these trivial : 0
% 0.33/300.13 # ...subsumed : 39
% 0.33/300.13 # ...remaining for further processing : 95
% 0.33/300.13 # Other redundant clauses eliminated : 0
% 0.33/300.13 # Clauses deleted for lack of memory : 0
% 0.33/300.13 # Backward-subsumed : 4
% 0.33/300.13 # Backward-rewritten : 3
% 0.33/300.13 # Generated clauses : 368
% 0.33/300.13 # ...of the previous two non-redundant : 254
% 0.33/300.13 # ...aggressively subsumed : 0
% 0.33/300.13 # Contextual simplify-reflections : 0
% 0.33/300.13 # Paramodulations : 304
% 0.33/300.13 # Factorizations : 64
% 0.33/300.13 # NegExts : 0
% 0.33/300.13 # Equation resolutions : 0
% 0.33/300.13 # Total rewrite steps : 128
% 0.33/300.13 # Propositional unsat checks : 0
% 0.33/300.13 # Propositional check models : 0
% 0.33/300.13 # Propositional check unsatisfiable : 0
% 0.33/300.13 # Propositional clauses : 0
% 0.33/300.13 # Propositional clauses after purity: 0
% 0.33/300.13 # Propositional unsat core size : 0
% 0.33/300.13 # Propositional preprocessing time : 0.000
% 0.33/300.13 # Propositional encoding time : 0.000
% 0.33/300.13 # Propositional solver time : 0.000
% 0.33/300.13 # Success case prop preproc time : 0.000
% 0.33/300.13 # Success case prop encoding time : 0.000
% 0.33/300.13 # Success case prop solver time : 0.000
% 0.33/300.13 # Current number of processed clauses : 69
% 0.33/300.13 # Positive orientable unit clauses : 8
% 0.33/300.13 # Positive unorientable unit clauses: 0
% 0.33/300.13 # Negative unit clauses : 4
% 0.33/300.13 # Non-unit-clauses : 57
% 0.33/300.13 # Current number of unprocessed clauses: 152
% 0.33/300.13 # ...number of literals in the above : 796
% 0.33/300.13 # Current number of archived formulas : 0
% 0.33/300.13 # Current number of archived clauses : 26
% 0.33/300.13 # Clause-clause subsumption calls (NU) : 634
% 0.33/300.13 # Rec. Clause-clause subsumption calls : 382
% 0.33/300.13 # Non-unit clause-clause subsumptions : 43
% 0.33/300.13 # Unit Clause-clause subsumption calls : 22
% 0.33/300.13 # Rewrite failures with RHS unbound : 0
% 0.33/300.13 # BW rewrite match attempts : 2
% 0.33/300.13 # BW rewrite match successes : 2
% 0.33/300.13 # Condensation attempts : 0
% 0.33/300.13 # Condensation successes : 0
% 0.33/300.13 # Termbank termtop insertions : 5780
% 0.33/300.13
% 0.33/300.13 # -------------------------------------------------
% 0.33/300.13 # User time : 0.012 s
% 0.33/300.13 # System time : 0.001 s
% 0.33/300.13 # Total time : 0.013 s
% 0.33/300.13 # Maximum resident set size: 1748 pages
% 0.33/300.13
% 0.33/300.13 # -------------------------------------------------
% 0.33/300.13 # User time : 0.047 s
% 0.33/300.13 # System time : 0.008 s
% 0.33/300.13 # Total time : 0.055 s
% 0.33/300.13 # Maximum resident set size: 1688 pages
% 0.33/300.13 % E---3.1 exiting
%------------------------------------------------------------------------------