TSTP Solution File: GEO195+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GEO195+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:32:01 EDT 2023
% Result : Theorem 0.19s 0.49s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 31 ( 17 unt; 0 def)
% Number of atoms : 60 ( 0 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 49 ( 20 ~; 14 |; 8 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 56 ( 6 sgn; 37 !; 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(X2,X1),X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Jt7EGuIMex/E---3.1_22108.p',con) ).
fof(cp2,axiom,
! [X1,X2] : ~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
file('/export/starexec/sandbox2/tmp/tmp.Jt7EGuIMex/E---3.1_22108.p',cp2) ).
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.Jt7EGuIMex/E---3.1_22108.p',ceq2) ).
fof(p1,axiom,
! [X1,X2] :
( distinct_lines(X1,X2)
=> convergent_lines(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.Jt7EGuIMex/E---3.1_22108.p',p1) ).
fof(cp1,axiom,
! [X1,X2] : ~ convergent_lines(parallel_through_point(X2,X1),X2),
file('/export/starexec/sandbox2/tmp/tmp.Jt7EGuIMex/E---3.1_22108.p',cp1) ).
fof(ax6,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( convergent_lines(X1,X3)
| convergent_lines(X2,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Jt7EGuIMex/E---3.1_22108.p',ax6) ).
fof(apart3,axiom,
! [X1] : ~ convergent_lines(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.Jt7EGuIMex/E---3.1_22108.p',apart3) ).
fof(c_0_7,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(X2,X1),X3) ) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_8,plain,
! [X1,X2] : ~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
inference(fof_simplification,[status(thm)],[cp2]) ).
fof(c_0_9,plain,
! [X14,X15,X16] :
( ~ apart_point_and_line(X14,X15)
| distinct_lines(X15,X16)
| apart_point_and_line(X14,X16) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq2])]) ).
fof(c_0_10,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(esk2_0,esk1_0),esk3_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
fof(c_0_11,plain,
! [X79,X80] : ~ apart_point_and_line(X79,parallel_through_point(X80,X79)),
inference(variable_rename,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( distinct_lines(X2,X3)
| apart_point_and_line(X1,X3)
| ~ apart_point_and_line(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,plain,
! [X41,X42] :
( ~ distinct_lines(X41,X42)
| convergent_lines(X41,X42) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p1])]) ).
cnf(c_0_15,plain,
~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),X1)
| distinct_lines(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_17,plain,
! [X1,X2] : ~ convergent_lines(parallel_through_point(X2,X1),X2),
inference(fof_simplification,[status(thm)],[cp1]) ).
fof(c_0_18,plain,
! [X27,X28,X29] :
( ~ convergent_lines(X27,X28)
| convergent_lines(X27,X29)
| convergent_lines(X28,X29) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax6])]) ).
cnf(c_0_19,plain,
( convergent_lines(X1,X2)
| ~ distinct_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,negated_conjecture,
distinct_lines(esk3_0,parallel_through_point(X1,intersection_point(esk1_0,esk2_0))),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_21,plain,
! [X1] : ~ convergent_lines(X1,X1),
inference(fof_simplification,[status(thm)],[apart3]) ).
fof(c_0_22,plain,
! [X77,X78] : ~ convergent_lines(parallel_through_point(X78,X77),X78),
inference(variable_rename,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
( convergent_lines(X1,X3)
| convergent_lines(X2,X3)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,negated_conjecture,
convergent_lines(esk3_0,parallel_through_point(X1,intersection_point(esk1_0,esk2_0))),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
fof(c_0_25,plain,
! [X26] : ~ convergent_lines(X26,X26),
inference(variable_rename,[status(thm)],[c_0_21]) ).
cnf(c_0_26,plain,
~ convergent_lines(parallel_through_point(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,negated_conjecture,
( convergent_lines(parallel_through_point(X1,intersection_point(esk1_0,esk2_0)),X2)
| convergent_lines(esk3_0,X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
~ convergent_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_29,negated_conjecture,
convergent_lines(esk3_0,X1),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_28,c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GEO195+3 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n006.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 2400
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Oct 3 06:31:55 EDT 2023
% 0.13/0.33 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.Jt7EGuIMex/E---3.1_22108.p
% 0.19/0.49 # Version: 3.1pre001
% 0.19/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 # Starting sh5l with 300s (1) cores
% 0.19/0.49 # new_bool_3 with pid 22188 completed with status 0
% 0.19/0.49 # Result found by new_bool_3
% 0.19/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.49 # Search class: FGHNF-FFMS22-SFFFFFNN
% 0.19/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.49 # SAT001_MinMin_p005000_rr_RG with pid 22192 completed with status 0
% 0.19/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.49 # Search class: FGHNF-FFMS22-SFFFFFNN
% 0.19/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.49 # Preprocessing time : 0.001 s
% 0.19/0.49 # Presaturation interreduction done
% 0.19/0.49
% 0.19/0.49 # Proof found!
% 0.19/0.49 # SZS status Theorem
% 0.19/0.49 # SZS output start CNFRefutation
% See solution above
% 0.19/0.49 # Parsed axioms : 36
% 0.19/0.49 # Removed by relevancy pruning/SinE : 5
% 0.19/0.49 # Initial clauses : 41
% 0.19/0.49 # Removed in clause preprocessing : 0
% 0.19/0.49 # Initial clauses in saturation : 41
% 0.19/0.49 # Processed clauses : 137
% 0.19/0.49 # ...of these trivial : 0
% 0.19/0.49 # ...subsumed : 24
% 0.19/0.49 # ...remaining for further processing : 113
% 0.19/0.49 # Other redundant clauses eliminated : 0
% 0.19/0.49 # Clauses deleted for lack of memory : 0
% 0.19/0.49 # Backward-subsumed : 2
% 0.19/0.49 # Backward-rewritten : 8
% 0.19/0.49 # Generated clauses : 157
% 0.19/0.49 # ...of the previous two non-redundant : 130
% 0.19/0.49 # ...aggressively subsumed : 0
% 0.19/0.49 # Contextual simplify-reflections : 0
% 0.19/0.49 # Paramodulations : 157
% 0.19/0.49 # Factorizations : 0
% 0.19/0.49 # NegExts : 0
% 0.19/0.49 # Equation resolutions : 0
% 0.19/0.49 # Total rewrite steps : 31
% 0.19/0.49 # Propositional unsat checks : 0
% 0.19/0.49 # Propositional check models : 0
% 0.19/0.49 # Propositional check unsatisfiable : 0
% 0.19/0.49 # Propositional clauses : 0
% 0.19/0.49 # Propositional clauses after purity: 0
% 0.19/0.49 # Propositional unsat core size : 0
% 0.19/0.49 # Propositional preprocessing time : 0.000
% 0.19/0.49 # Propositional encoding time : 0.000
% 0.19/0.49 # Propositional solver time : 0.000
% 0.19/0.49 # Success case prop preproc time : 0.000
% 0.19/0.49 # Success case prop encoding time : 0.000
% 0.19/0.49 # Success case prop solver time : 0.000
% 0.19/0.49 # Current number of processed clauses : 66
% 0.19/0.49 # Positive orientable unit clauses : 19
% 0.19/0.49 # Positive unorientable unit clauses: 0
% 0.19/0.49 # Negative unit clauses : 8
% 0.19/0.49 # Non-unit-clauses : 39
% 0.19/0.49 # Current number of unprocessed clauses: 71
% 0.19/0.49 # ...number of literals in the above : 231
% 0.19/0.49 # Current number of archived formulas : 0
% 0.19/0.49 # Current number of archived clauses : 47
% 0.19/0.49 # Clause-clause subsumption calls (NU) : 256
% 0.19/0.49 # Rec. Clause-clause subsumption calls : 168
% 0.19/0.49 # Non-unit clause-clause subsumptions : 24
% 0.19/0.49 # Unit Clause-clause subsumption calls : 68
% 0.19/0.49 # Rewrite failures with RHS unbound : 0
% 0.19/0.49 # BW rewrite match attempts : 6
% 0.19/0.49 # BW rewrite match successes : 6
% 0.19/0.49 # Condensation attempts : 0
% 0.19/0.49 # Condensation successes : 0
% 0.19/0.49 # Termbank termtop insertions : 4332
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.009 s
% 0.19/0.49 # System time : 0.002 s
% 0.19/0.49 # Total time : 0.011 s
% 0.19/0.49 # Maximum resident set size: 1892 pages
% 0.19/0.49
% 0.19/0.49 # -------------------------------------------------
% 0.19/0.49 # User time : 0.010 s
% 0.19/0.49 # System time : 0.004 s
% 0.19/0.49 # Total time : 0.014 s
% 0.19/0.49 # Maximum resident set size: 1732 pages
% 0.19/0.49 % E---3.1 exiting
% 0.19/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------