TSTP Solution File: GEO197+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GEO197+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:44:57 EDT 2024
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 50 ( 16 unt; 0 def)
% Number of atoms : 126 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 117 ( 41 ~; 54 |; 11 &)
% ( 0 <=>; 11 =>; 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 : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 90 ( 0 sgn 56 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2,X3] :
( ( convergent_lines(X1,X2)
& convergent_lines(X3,X2)
& convergent_lines(X1,X3)
& ~ apart_point_and_line(intersection_point(X1,X2),X3) )
=> ~ apart_point_and_line(intersection_point(X3,X2),X1) ),
file('/export/starexec/sandbox/tmp/tmp.xiYffVq3NA/E---3.1_1077.p',con) ).
fof(apart3,axiom,
! [X1] : ~ convergent_lines(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.xiYffVq3NA/E---3.1_1077.p',apart3) ).
fof(ax6,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( convergent_lines(X1,X3)
| convergent_lines(X2,X3) ) ),
file('/export/starexec/sandbox/tmp/tmp.xiYffVq3NA/E---3.1_1077.p',ax6) ).
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/sandbox/tmp/tmp.xiYffVq3NA/E---3.1_1077.p',ceq2) ).
fof(ci3,axiom,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/tmp.xiYffVq3NA/E---3.1_1077.p',ci3) ).
fof(ceq1,axiom,
! [X1,X2,X3] :
( apart_point_and_line(X1,X2)
=> ( distinct_points(X1,X3)
| apart_point_and_line(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.xiYffVq3NA/E---3.1_1077.p',ceq1) ).
fof(ceq3,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( distinct_lines(X2,X3)
| convergent_lines(X1,X3) ) ),
file('/export/starexec/sandbox/tmp/tmp.xiYffVq3NA/E---3.1_1077.p',ceq3) ).
fof(apart2,axiom,
! [X1] : ~ distinct_lines(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.xiYffVq3NA/E---3.1_1077.p',apart2) ).
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.xiYffVq3NA/E---3.1_1077.p',cu1) ).
fof(ci4,axiom,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/tmp.xiYffVq3NA/E---3.1_1077.p',ci4) ).
fof(c_0_10,negated_conjecture,
~ ! [X1,X2,X3] :
( ( convergent_lines(X1,X2)
& convergent_lines(X3,X2)
& convergent_lines(X1,X3)
& ~ apart_point_and_line(intersection_point(X1,X2),X3) )
=> ~ apart_point_and_line(intersection_point(X3,X2),X1) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[con])]) ).
fof(c_0_11,plain,
! [X1] : ~ convergent_lines(X1,X1),
inference(fof_simplification,[status(thm)],[apart3]) ).
fof(c_0_12,plain,
! [X15,X16,X17] :
( ~ convergent_lines(X15,X16)
| convergent_lines(X15,X17)
| convergent_lines(X16,X17) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax6])])]) ).
fof(c_0_13,negated_conjecture,
( convergent_lines(esk1_0,esk2_0)
& convergent_lines(esk3_0,esk2_0)
& convergent_lines(esk1_0,esk3_0)
& ~ apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)
& apart_point_and_line(intersection_point(esk3_0,esk2_0),esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
fof(c_0_14,plain,
! [X33,X34,X35] :
( ~ apart_point_and_line(X33,X34)
| distinct_lines(X34,X35)
| apart_point_and_line(X33,X35) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq2])])]) ).
fof(c_0_15,plain,
! [X8] : ~ convergent_lines(X8,X8),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_11])]) ).
cnf(c_0_16,plain,
( convergent_lines(X1,X3)
| convergent_lines(X2,X3)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
convergent_lines(esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,plain,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
inference(fof_simplification,[status(thm)],[ci3]) ).
fof(c_0_19,plain,
! [X30,X31,X32] :
( ~ apart_point_and_line(X30,X31)
| distinct_points(X30,X32)
| apart_point_and_line(X32,X31) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq1])])]) ).
cnf(c_0_20,plain,
( distinct_lines(X2,X3)
| apart_point_and_line(X1,X3)
| ~ apart_point_and_line(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
apart_point_and_line(intersection_point(esk3_0,esk2_0),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_22,plain,
! [X36,X37,X38] :
( ~ convergent_lines(X36,X37)
| distinct_lines(X37,X38)
| convergent_lines(X36,X38) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq3])])]) ).
cnf(c_0_23,plain,
~ convergent_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,negated_conjecture,
( convergent_lines(esk3_0,X1)
| convergent_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_25,plain,
! [X22,X23] :
( ~ convergent_lines(X22,X23)
| ~ apart_point_and_line(intersection_point(X22,X23),X22) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])]) ).
cnf(c_0_26,plain,
( distinct_points(X1,X3)
| apart_point_and_line(X3,X2)
| ~ apart_point_and_line(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,negated_conjecture,
( apart_point_and_line(intersection_point(esk3_0,esk2_0),X1)
| distinct_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
fof(c_0_28,plain,
! [X1] : ~ distinct_lines(X1,X1),
inference(fof_simplification,[status(thm)],[apart2]) ).
fof(c_0_29,plain,
! [X26,X27,X28,X29] :
( ~ distinct_points(X26,X27)
| ~ distinct_lines(X28,X29)
| apart_point_and_line(X26,X28)
| apart_point_and_line(X26,X29)
| apart_point_and_line(X27,X28)
| apart_point_and_line(X27,X29) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cu1])])]) ).
cnf(c_0_30,plain,
( distinct_lines(X2,X3)
| convergent_lines(X1,X3)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_31,negated_conjecture,
convergent_lines(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_32,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_33,negated_conjecture,
( apart_point_and_line(X1,X2)
| distinct_lines(esk1_0,X2)
| distinct_points(intersection_point(esk3_0,esk2_0),X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
fof(c_0_34,plain,
! [X7] : ~ distinct_lines(X7,X7),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_28])]) ).
cnf(c_0_35,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_29]) ).
cnf(c_0_36,negated_conjecture,
( convergent_lines(esk2_0,X1)
| distinct_lines(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,negated_conjecture,
( distinct_lines(esk1_0,X1)
| distinct_points(intersection_point(esk3_0,esk2_0),intersection_point(X1,X2))
| ~ convergent_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_39,plain,
~ distinct_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
fof(c_0_40,plain,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
inference(fof_simplification,[status(thm)],[ci4]) ).
cnf(c_0_41,negated_conjecture,
( apart_point_and_line(X1,esk3_0)
| apart_point_and_line(X2,esk3_0)
| apart_point_and_line(X1,X3)
| apart_point_and_line(X2,X3)
| convergent_lines(esk2_0,X3)
| ~ distinct_points(X1,X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,negated_conjecture,
distinct_points(intersection_point(esk3_0,esk2_0),intersection_point(esk1_0,esk2_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_43,negated_conjecture,
~ apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_44,plain,
! [X24,X25] :
( ~ convergent_lines(X24,X25)
| ~ apart_point_and_line(intersection_point(X24,X25),X25) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_40])])]) ).
cnf(c_0_45,negated_conjecture,
( apart_point_and_line(intersection_point(esk3_0,esk2_0),esk3_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),X1)
| apart_point_and_line(intersection_point(esk3_0,esk2_0),X1)
| convergent_lines(esk2_0,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
cnf(c_0_46,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_47,negated_conjecture,
( apart_point_and_line(intersection_point(esk3_0,esk2_0),X1)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),X1)
| convergent_lines(esk2_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_45]),c_0_17])]) ).
cnf(c_0_48,negated_conjecture,
apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_17])]),c_0_23]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_48]),c_0_38])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14 % Problem : GEO197+1 : TPTP v8.1.2. Released v3.3.0.
% 0.12/0.15 % Command : run_E %s %d THM
% 0.19/0.35 % Computer : n008.cluster.edu
% 0.19/0.35 % Model : x86_64 x86_64
% 0.19/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.35 % Memory : 8042.1875MB
% 0.19/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.19/0.35 % CPULimit : 300
% 0.19/0.35 % WCLimit : 300
% 0.19/0.35 % DateTime : Fri May 3 18:41:37 EDT 2024
% 0.19/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 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.xiYffVq3NA/E---3.1_1077.p
% 0.20/0.50 # Version: 3.1.0
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1167 completed with status 0
% 0.20/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: FGHNF-FFSS22-SFFFFFNN
% 0.20/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.50 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.50 # Starting sh5l with 136s (1) cores
% 0.20/0.50 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1172 completed with status 0
% 0.20/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: FGHNF-FFSS22-SFFFFFNN
% 0.20/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Theorem
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 15
% 0.20/0.50 # Removed by relevancy pruning/SinE : 0
% 0.20/0.50 # Initial clauses : 19
% 0.20/0.50 # Removed in clause preprocessing : 0
% 0.20/0.50 # Initial clauses in saturation : 19
% 0.20/0.50 # Processed clauses : 227
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 81
% 0.20/0.50 # ...remaining for further processing : 146
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 1
% 0.20/0.50 # Backward-rewritten : 0
% 0.20/0.50 # Generated clauses : 807
% 0.20/0.50 # ...of the previous two non-redundant : 606
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 0
% 0.20/0.50 # Paramodulations : 715
% 0.20/0.50 # Factorizations : 92
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Disequality decompositions : 0
% 0.20/0.50 # Total rewrite steps : 214
% 0.20/0.50 # ...of those cached : 197
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 126
% 0.20/0.50 # Positive orientable unit clauses : 23
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 4
% 0.20/0.50 # Non-unit-clauses : 99
% 0.20/0.50 # Current number of unprocessed clauses: 415
% 0.20/0.50 # ...number of literals in the above : 1830
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 20
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 1031
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 546
% 0.20/0.50 # Non-unit clause-clause subsumptions : 82
% 0.20/0.50 # Unit Clause-clause subsumption calls : 29
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 15
% 0.20/0.50 # BW rewrite match successes : 0
% 0.20/0.50 # Condensation attempts : 0
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 11805
% 0.20/0.50 # Search garbage collected termcells : 218
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.017 s
% 0.20/0.50 # System time : 0.003 s
% 0.20/0.50 # Total time : 0.019 s
% 0.20/0.50 # Maximum resident set size: 1760 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.080 s
% 0.20/0.50 # System time : 0.009 s
% 0.20/0.50 # Total time : 0.089 s
% 0.20/0.50 # Maximum resident set size: 1700 pages
% 0.20/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------