TSTP Solution File: GEO172+3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GEO172+3 : TPTP v8.1.2. Released v4.0.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:08 EDT 2023
% Result : Theorem 0.16s 0.50s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 41 ( 13 unt; 0 def)
% Number of atoms : 100 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 97 ( 38 ~; 37 |; 10 &)
% ( 4 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 68 ( 0 sgn; 47 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2,X3] :
( ( convergent_lines(X1,X2)
& incident_point_and_line(X3,X1)
& incident_point_and_line(X3,X2) )
=> equal_points(X3,intersection_point(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.kHaFIGtZbJ/E---3.1_17576.p',con) ).
fof(ceq3,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( distinct_lines(X2,X3)
| convergent_lines(X1,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.kHaFIGtZbJ/E---3.1_17576.p',ceq3) ).
fof(ax1,axiom,
! [X1,X2] :
( equal_points(X1,X2)
<=> ~ distinct_points(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.kHaFIGtZbJ/E---3.1_17576.p',ax1) ).
fof(a4,axiom,
! [X1,X2] :
( incident_point_and_line(X1,X2)
<=> ~ apart_point_and_line(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.kHaFIGtZbJ/E---3.1_17576.p',a4) ).
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.kHaFIGtZbJ/E---3.1_17576.p',cu1) ).
fof(ci3,axiom,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/tmp.kHaFIGtZbJ/E---3.1_17576.p',ci3) ).
fof(apart3,axiom,
! [X1] : ~ convergent_lines(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.kHaFIGtZbJ/E---3.1_17576.p',apart3) ).
fof(ci4,axiom,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/tmp.kHaFIGtZbJ/E---3.1_17576.p',ci4) ).
fof(c_0_8,negated_conjecture,
~ ! [X1,X2,X3] :
( ( convergent_lines(X1,X2)
& incident_point_and_line(X3,X1)
& incident_point_and_line(X3,X2) )
=> equal_points(X3,intersection_point(X1,X2)) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_9,plain,
! [X41,X42,X43] :
( ~ convergent_lines(X41,X42)
| distinct_lines(X42,X43)
| convergent_lines(X41,X43) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq3])]) ).
fof(c_0_10,negated_conjecture,
( convergent_lines(esk1_0,esk2_0)
& incident_point_and_line(esk3_0,esk1_0)
& incident_point_and_line(esk3_0,esk2_0)
& ~ equal_points(esk3_0,intersection_point(esk1_0,esk2_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_11,plain,
! [X1,X2] :
( equal_points(X1,X2)
<=> ~ distinct_points(X1,X2) ),
inference(fof_simplification,[status(thm)],[ax1]) ).
fof(c_0_12,plain,
! [X1,X2] :
( incident_point_and_line(X1,X2)
<=> ~ apart_point_and_line(X1,X2) ),
inference(fof_simplification,[status(thm)],[a4]) ).
fof(c_0_13,plain,
! [X31,X32,X33,X34] :
( ~ distinct_points(X31,X32)
| ~ distinct_lines(X33,X34)
| apart_point_and_line(X31,X33)
| apart_point_and_line(X31,X34)
| apart_point_and_line(X32,X33)
| apart_point_and_line(X32,X34) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cu1])]) ).
cnf(c_0_14,plain,
( distinct_lines(X2,X3)
| convergent_lines(X1,X3)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_16,plain,
! [X82,X83] :
( ( ~ equal_points(X82,X83)
| ~ distinct_points(X82,X83) )
& ( distinct_points(X82,X83)
| equal_points(X82,X83) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])]) ).
fof(c_0_17,plain,
! [X88,X89] :
( ( ~ incident_point_and_line(X88,X89)
| ~ apart_point_and_line(X88,X89) )
& ( apart_point_and_line(X88,X89)
| incident_point_and_line(X88,X89) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])]) ).
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]) ).
cnf(c_0_19,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_13]) ).
cnf(c_0_20,negated_conjecture,
( convergent_lines(esk1_0,X1)
| distinct_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,negated_conjecture,
~ equal_points(esk3_0,intersection_point(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_22,plain,
( distinct_points(X1,X2)
| equal_points(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
( ~ incident_point_and_line(X1,X2)
| ~ apart_point_and_line(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,negated_conjecture,
incident_point_and_line(esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_25,plain,
! [X1] : ~ convergent_lines(X1,X1),
inference(fof_simplification,[status(thm)],[apart3]) ).
fof(c_0_26,plain,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
inference(fof_simplification,[status(thm)],[ci4]) ).
fof(c_0_27,plain,
! [X27,X28] :
( ~ convergent_lines(X27,X28)
| ~ apart_point_and_line(intersection_point(X27,X28),X27) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])]) ).
cnf(c_0_28,negated_conjecture,
( apart_point_and_line(X1,esk2_0)
| apart_point_and_line(X2,esk2_0)
| apart_point_and_line(X1,X3)
| apart_point_and_line(X2,X3)
| convergent_lines(esk1_0,X3)
| ~ distinct_points(X1,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_29,negated_conjecture,
distinct_points(esk3_0,intersection_point(esk1_0,esk2_0)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_30,negated_conjecture,
~ apart_point_and_line(esk3_0,esk2_0),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,negated_conjecture,
incident_point_and_line(esk3_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_32,plain,
! [X13] : ~ convergent_lines(X13,X13),
inference(variable_rename,[status(thm)],[c_0_25]) ).
fof(c_0_33,plain,
! [X29,X30] :
( ~ convergent_lines(X29,X30)
| ~ apart_point_and_line(intersection_point(X29,X30),X30) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_26])]) ).
cnf(c_0_34,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_35,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),X1)
| apart_point_and_line(esk3_0,X1)
| convergent_lines(esk1_0,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_36,negated_conjecture,
~ apart_point_and_line(esk3_0,esk1_0),
inference(spm,[status(thm)],[c_0_23,c_0_31]) ).
cnf(c_0_37,plain,
~ convergent_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_38,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_39,negated_conjecture,
apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_15])]),c_0_36]),c_0_37]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : GEO172+3 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n007.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Oct 3 06:18:25 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running first-order model finding
% 0.16/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.kHaFIGtZbJ/E---3.1_17576.p
% 0.16/0.50 # Version: 3.1pre001
% 0.16/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.50 # Starting sh5l with 300s (1) cores
% 0.16/0.50 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 17654 completed with status 0
% 0.16/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.50 # No SInE strategy applied
% 0.16/0.50 # Search class: FGHNF-FFMS22-SFFFFFNN
% 0.16/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.16/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.50 # Starting new_bool_3 with 136s (1) cores
% 0.16/0.50 # Starting new_bool_1 with 136s (1) cores
% 0.16/0.50 # Starting sh5l with 136s (1) cores
% 0.16/0.50 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 17660 completed with status 0
% 0.16/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.50 # No SInE strategy applied
% 0.16/0.50 # Search class: FGHNF-FFMS22-SFFFFFNN
% 0.16/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.16/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.50 # Preprocessing time : 0.001 s
% 0.16/0.50 # Presaturation interreduction done
% 0.16/0.50
% 0.16/0.50 # Proof found!
% 0.16/0.50 # SZS status Theorem
% 0.16/0.50 # SZS output start CNFRefutation
% See solution above
% 0.16/0.51 # Parsed axioms : 36
% 0.16/0.51 # Removed by relevancy pruning/SinE : 0
% 0.16/0.51 # Initial clauses : 50
% 0.16/0.51 # Removed in clause preprocessing : 0
% 0.16/0.51 # Initial clauses in saturation : 50
% 0.16/0.51 # Processed clauses : 599
% 0.16/0.51 # ...of these trivial : 11
% 0.16/0.51 # ...subsumed : 251
% 0.16/0.51 # ...remaining for further processing : 337
% 0.16/0.51 # Other redundant clauses eliminated : 0
% 0.16/0.51 # Clauses deleted for lack of memory : 0
% 0.16/0.51 # Backward-subsumed : 21
% 0.16/0.51 # Backward-rewritten : 36
% 0.16/0.51 # Generated clauses : 3021
% 0.16/0.51 # ...of the previous two non-redundant : 2645
% 0.16/0.51 # ...aggressively subsumed : 0
% 0.16/0.51 # Contextual simplify-reflections : 7
% 0.16/0.51 # Paramodulations : 2921
% 0.16/0.51 # Factorizations : 100
% 0.16/0.51 # NegExts : 0
% 0.16/0.51 # Equation resolutions : 0
% 0.16/0.51 # Total rewrite steps : 429
% 0.16/0.51 # Propositional unsat checks : 0
% 0.16/0.51 # Propositional check models : 0
% 0.16/0.51 # Propositional check unsatisfiable : 0
% 0.16/0.51 # Propositional clauses : 0
% 0.16/0.51 # Propositional clauses after purity: 0
% 0.16/0.51 # Propositional unsat core size : 0
% 0.16/0.51 # Propositional preprocessing time : 0.000
% 0.16/0.51 # Propositional encoding time : 0.000
% 0.16/0.51 # Propositional solver time : 0.000
% 0.16/0.51 # Success case prop preproc time : 0.000
% 0.16/0.51 # Success case prop encoding time : 0.000
% 0.16/0.51 # Success case prop solver time : 0.000
% 0.16/0.51 # Current number of processed clauses : 234
% 0.16/0.51 # Positive orientable unit clauses : 27
% 0.16/0.51 # Positive unorientable unit clauses: 0
% 0.16/0.51 # Negative unit clauses : 10
% 0.16/0.51 # Non-unit-clauses : 197
% 0.16/0.51 # Current number of unprocessed clauses: 1966
% 0.16/0.51 # ...number of literals in the above : 9300
% 0.16/0.51 # Current number of archived formulas : 0
% 0.16/0.51 # Current number of archived clauses : 103
% 0.16/0.51 # Clause-clause subsumption calls (NU) : 16560
% 0.16/0.51 # Rec. Clause-clause subsumption calls : 5416
% 0.16/0.51 # Non-unit clause-clause subsumptions : 225
% 0.16/0.51 # Unit Clause-clause subsumption calls : 747
% 0.16/0.51 # Rewrite failures with RHS unbound : 0
% 0.16/0.51 # BW rewrite match attempts : 46
% 0.16/0.51 # BW rewrite match successes : 7
% 0.16/0.51 # Condensation attempts : 0
% 0.16/0.51 # Condensation successes : 0
% 0.16/0.51 # Termbank termtop insertions : 39707
% 0.16/0.51
% 0.16/0.51 # -------------------------------------------------
% 0.16/0.51 # User time : 0.062 s
% 0.16/0.51 # System time : 0.002 s
% 0.16/0.51 # Total time : 0.064 s
% 0.16/0.51 # Maximum resident set size: 1856 pages
% 0.16/0.51
% 0.16/0.51 # -------------------------------------------------
% 0.16/0.51 # User time : 0.307 s
% 0.16/0.51 # System time : 0.003 s
% 0.16/0.51 # Total time : 0.310 s
% 0.16/0.51 # Maximum resident set size: 1728 pages
% 0.16/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------