TSTP Solution File: GEO175+2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GEO175+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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:09 EDT 2023
% Result : Theorem 0.15s 0.44s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 9
% Syntax : Number of formulae : 50 ( 20 unt; 0 def)
% Number of atoms : 121 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 112 ( 41 ~; 53 |; 10 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 85 ( 0 sgn; 47 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2,X4,X5] :
( ( distinct_points(X1,X2)
& convergent_lines(X4,X5)
& distinct_points(X1,intersection_point(X4,X5)) )
=> ( apart_point_and_line(X1,X4)
| apart_point_and_line(X1,X5) ) ),
file('/export/starexec/sandbox/tmp/tmp.7WODuEVMfo/E---3.1_19248.p',con) ).
fof(apart6,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( convergent_lines(X1,X3)
| convergent_lines(X2,X3) ) ),
file('/export/starexec/sandbox/tmp/tmp.7WODuEVMfo/E---3.1_19248.p',apart6) ).
fof(apart3,axiom,
! [X1] : ~ convergent_lines(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.7WODuEVMfo/E---3.1_19248.p',apart3) ).
fof(apart5,axiom,
! [X1,X2,X3] :
( distinct_lines(X1,X2)
=> ( distinct_lines(X1,X3)
| distinct_lines(X2,X3) ) ),
file('/export/starexec/sandbox/tmp/tmp.7WODuEVMfo/E---3.1_19248.p',apart5) ).
fof(ceq3,axiom,
! [X1,X2] :
( convergent_lines(X1,X2)
=> distinct_lines(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.7WODuEVMfo/E---3.1_19248.p',ceq3) ).
fof(apart2,axiom,
! [X1] : ~ distinct_lines(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.7WODuEVMfo/E---3.1_19248.p',apart2) ).
fof(apart1,axiom,
! [X1] : ~ distinct_points(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.7WODuEVMfo/E---3.1_19248.p',apart1) ).
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/sandbox/tmp/tmp.7WODuEVMfo/E---3.1_19248.p',cu1) ).
fof(con2,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( ( apart_point_and_line(X3,X1)
| apart_point_and_line(X3,X2) )
=> distinct_points(X3,intersection_point(X1,X2)) ) ),
file('/export/starexec/sandbox/tmp/tmp.7WODuEVMfo/E---3.1_19248.p',con2) ).
fof(c_0_9,negated_conjecture,
~ ! [X1,X2,X4,X5] :
( ( distinct_points(X1,X2)
& convergent_lines(X4,X5)
& distinct_points(X1,intersection_point(X4,X5)) )
=> ( apart_point_and_line(X1,X4)
| apart_point_and_line(X1,X5) ) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_10,plain,
! [X28,X29,X30] :
( ~ convergent_lines(X28,X29)
| convergent_lines(X28,X30)
| convergent_lines(X29,X30) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[apart6])]) ).
fof(c_0_11,negated_conjecture,
( distinct_points(esk1_0,esk2_0)
& convergent_lines(esk3_0,esk4_0)
& distinct_points(esk1_0,intersection_point(esk3_0,esk4_0))
& ~ apart_point_and_line(esk1_0,esk3_0)
& ~ apart_point_and_line(esk1_0,esk4_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
fof(c_0_12,plain,
! [X1] : ~ convergent_lines(X1,X1),
inference(fof_simplification,[status(thm)],[apart3]) ).
cnf(c_0_13,plain,
( convergent_lines(X1,X3)
| convergent_lines(X2,X3)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
convergent_lines(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,plain,
! [X27] : ~ convergent_lines(X27,X27),
inference(variable_rename,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( convergent_lines(esk3_0,X1)
| convergent_lines(esk4_0,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
~ convergent_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_18,negated_conjecture,
( convergent_lines(esk3_0,X1)
| convergent_lines(esk4_0,X2)
| convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
( convergent_lines(X1,esk4_0)
| convergent_lines(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_20,plain,
! [X34,X35,X36] :
( ~ distinct_lines(X34,X35)
| distinct_lines(X34,X36)
| distinct_lines(X35,X36) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[apart5])]) ).
fof(c_0_21,plain,
! [X31,X32] :
( ~ convergent_lines(X31,X32)
| distinct_lines(X31,X32) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq3])]) ).
cnf(c_0_22,negated_conjecture,
( convergent_lines(X1,esk4_0)
| convergent_lines(esk3_0,X2)
| convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_19]) ).
fof(c_0_23,plain,
! [X1] : ~ distinct_lines(X1,X1),
inference(fof_simplification,[status(thm)],[apart2]) ).
cnf(c_0_24,plain,
( distinct_lines(X1,X3)
| distinct_lines(X2,X3)
| ~ distinct_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,plain,
( distinct_lines(X1,X2)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,negated_conjecture,
( convergent_lines(X1,esk3_0)
| convergent_lines(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_22]) ).
fof(c_0_27,plain,
! [X33] : ~ distinct_lines(X33,X33),
inference(variable_rename,[status(thm)],[c_0_23]) ).
cnf(c_0_28,plain,
( distinct_lines(X1,X2)
| distinct_lines(X3,X2)
| ~ convergent_lines(X1,X3) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
convergent_lines(esk4_0,esk3_0),
inference(spm,[status(thm)],[c_0_17,c_0_26]) ).
fof(c_0_30,plain,
! [X1] : ~ distinct_points(X1,X1),
inference(fof_simplification,[status(thm)],[apart1]) ).
fof(c_0_31,plain,
! [X10,X11,X12,X13] :
( ~ distinct_points(X10,X11)
| ~ distinct_lines(X12,X13)
| apart_point_and_line(X10,X12)
| apart_point_and_line(X10,X13)
| apart_point_and_line(X11,X12)
| apart_point_and_line(X11,X13) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cu1])]) ).
cnf(c_0_32,plain,
~ distinct_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_33,negated_conjecture,
( distinct_lines(esk3_0,X1)
| distinct_lines(esk4_0,X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
fof(c_0_34,plain,
! [X20] : ~ distinct_points(X20,X20),
inference(variable_rename,[status(thm)],[c_0_30]) ).
fof(c_0_35,plain,
! [X24,X25,X26] :
( ( ~ apart_point_and_line(X26,X24)
| distinct_points(X26,intersection_point(X24,X25))
| ~ convergent_lines(X24,X25) )
& ( ~ apart_point_and_line(X26,X25)
| distinct_points(X26,intersection_point(X24,X25))
| ~ convergent_lines(X24,X25) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[con2])])]) ).
cnf(c_0_36,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_31]) ).
cnf(c_0_37,negated_conjecture,
distinct_lines(esk3_0,esk4_0),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,plain,
~ distinct_points(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_39,plain,
( distinct_points(X1,intersection_point(X3,X2))
| ~ apart_point_and_line(X1,X2)
| ~ convergent_lines(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_40,negated_conjecture,
( apart_point_and_line(X1,esk3_0)
| apart_point_and_line(X1,esk4_0)
| apart_point_and_line(X2,esk3_0)
| apart_point_and_line(X2,esk4_0)
| ~ distinct_points(X1,X2) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,negated_conjecture,
distinct_points(esk1_0,intersection_point(esk3_0,esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_42,negated_conjecture,
~ apart_point_and_line(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_43,negated_conjecture,
~ apart_point_and_line(esk1_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_44,plain,
( distinct_points(X1,intersection_point(X2,X3))
| ~ apart_point_and_line(X1,X2)
| ~ convergent_lines(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_45,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X2)
| ~ convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_46,negated_conjecture,
( apart_point_and_line(intersection_point(esk3_0,esk4_0),esk4_0)
| apart_point_and_line(intersection_point(esk3_0,esk4_0),esk3_0) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_43]) ).
cnf(c_0_47,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X1)
| ~ convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_44]) ).
cnf(c_0_48,negated_conjecture,
apart_point_and_line(intersection_point(esk3_0,esk4_0),esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_14])]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : GEO175+2 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n007.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Oct 3 06:41:40 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.42 Running first-order model finding
% 0.15/0.42 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.7WODuEVMfo/E---3.1_19248.p
% 0.15/0.44 # Version: 3.1pre001
% 0.15/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 # Starting sh5l with 300s (1) cores
% 0.15/0.44 # new_bool_3 with pid 19326 completed with status 0
% 0.15/0.44 # Result found by new_bool_3
% 0.15/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.44 # Search class: FGUNF-FFSS22-SFFFFFNN
% 0.15/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.44 # SAT001_MinMin_p005000_rr_RG with pid 19336 completed with status 0
% 0.15/0.44 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.15/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.44 # Search class: FGUNF-FFSS22-SFFFFFNN
% 0.15/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.44 # Preprocessing time : 0.001 s
% 0.15/0.44 # Presaturation interreduction done
% 0.15/0.44
% 0.15/0.44 # Proof found!
% 0.15/0.44 # SZS status Theorem
% 0.15/0.44 # SZS output start CNFRefutation
% See solution above
% 0.15/0.44 # Parsed axioms : 13
% 0.15/0.44 # Removed by relevancy pruning/SinE : 1
% 0.15/0.44 # Initial clauses : 17
% 0.15/0.44 # Removed in clause preprocessing : 0
% 0.15/0.44 # Initial clauses in saturation : 17
% 0.15/0.44 # Processed clauses : 102
% 0.15/0.44 # ...of these trivial : 0
% 0.15/0.44 # ...subsumed : 27
% 0.15/0.44 # ...remaining for further processing : 75
% 0.15/0.44 # Other redundant clauses eliminated : 0
% 0.15/0.44 # Clauses deleted for lack of memory : 0
% 0.15/0.44 # Backward-subsumed : 0
% 0.15/0.44 # Backward-rewritten : 1
% 0.15/0.44 # Generated clauses : 241
% 0.15/0.44 # ...of the previous two non-redundant : 182
% 0.15/0.44 # ...aggressively subsumed : 0
% 0.15/0.44 # Contextual simplify-reflections : 0
% 0.15/0.44 # Paramodulations : 191
% 0.15/0.44 # Factorizations : 50
% 0.15/0.44 # NegExts : 0
% 0.15/0.44 # Equation resolutions : 0
% 0.15/0.44 # Total rewrite steps : 61
% 0.15/0.44 # Propositional unsat checks : 0
% 0.15/0.44 # Propositional check models : 0
% 0.15/0.44 # Propositional check unsatisfiable : 0
% 0.15/0.44 # Propositional clauses : 0
% 0.15/0.44 # Propositional clauses after purity: 0
% 0.15/0.44 # Propositional unsat core size : 0
% 0.15/0.44 # Propositional preprocessing time : 0.000
% 0.15/0.44 # Propositional encoding time : 0.000
% 0.15/0.44 # Propositional solver time : 0.000
% 0.15/0.44 # Success case prop preproc time : 0.000
% 0.15/0.44 # Success case prop encoding time : 0.000
% 0.15/0.44 # Success case prop solver time : 0.000
% 0.15/0.44 # Current number of processed clauses : 57
% 0.15/0.44 # Positive orientable unit clauses : 7
% 0.15/0.44 # Positive unorientable unit clauses: 0
% 0.15/0.44 # Negative unit clauses : 5
% 0.15/0.44 # Non-unit-clauses : 45
% 0.15/0.44 # Current number of unprocessed clauses: 110
% 0.15/0.44 # ...number of literals in the above : 489
% 0.15/0.44 # Current number of archived formulas : 0
% 0.15/0.44 # Current number of archived clauses : 18
% 0.15/0.44 # Clause-clause subsumption calls (NU) : 354
% 0.15/0.44 # Rec. Clause-clause subsumption calls : 235
% 0.15/0.44 # Non-unit clause-clause subsumptions : 26
% 0.15/0.44 # Unit Clause-clause subsumption calls : 15
% 0.15/0.44 # Rewrite failures with RHS unbound : 0
% 0.15/0.44 # BW rewrite match attempts : 1
% 0.15/0.44 # BW rewrite match successes : 1
% 0.15/0.44 # Condensation attempts : 0
% 0.15/0.44 # Condensation successes : 0
% 0.15/0.44 # Termbank termtop insertions : 3442
% 0.15/0.44
% 0.15/0.44 # -------------------------------------------------
% 0.15/0.44 # User time : 0.010 s
% 0.15/0.44 # System time : 0.000 s
% 0.15/0.44 # Total time : 0.010 s
% 0.15/0.44 # Maximum resident set size: 1768 pages
% 0.15/0.44
% 0.15/0.44 # -------------------------------------------------
% 0.15/0.44 # User time : 0.010 s
% 0.15/0.44 # System time : 0.003 s
% 0.15/0.44 # Total time : 0.013 s
% 0.15/0.44 # Maximum resident set size: 1688 pages
% 0.15/0.44 % E---3.1 exiting
%------------------------------------------------------------------------------