TSTP Solution File: GEO262+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GEO262+1 : TPTP v8.1.2. Bugfixed v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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:26 EDT 2023
% Result : Theorem 0.17s 0.45s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 5 unt; 0 def)
% Number of atoms : 58 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 64 ( 24 ~; 15 |; 21 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 34 ( 2 sgn; 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X2,X3,X6,X1,X4,X5] :
( ( between_on_line(X2,X1,X4,X5)
& convergent_lines(X2,X3)
& ~ apart_point_and_line(X4,X3)
& convergent_lines(X2,X6)
& convergent_lines(X3,X6)
& ~ apart_point_and_line(X4,X6) )
=> between_on_line(X3,intersection_point(X3,parallel_through_point(X6,X1)),X4,intersection_point(X3,parallel_through_point(X6,X5))) ),
file('/export/starexec/sandbox2/tmp/tmp.tEMTL3rq4w/E---3.1_29839.p',con) ).
fof(oag9,axiom,
! [X2,X3] :
( ( unequally_directed_lines(X2,X3)
& unequally_directed_lines(X2,reverse_line(X3)) )
=> ( left_convergent_lines(X2,X3)
| left_convergent_lines(X2,reverse_line(X3)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.tEMTL3rq4w/E---3.1_29839.p',oag9) ).
fof(oag11,axiom,
! [X2,X3] :
~ ( left_convergent_lines(X2,X3)
| left_convergent_lines(X2,reverse_line(X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.tEMTL3rq4w/E---3.1_29839.p',oag11) ).
fof(con_def,axiom,
! [X2,X3] :
( convergent_lines(X2,X3)
<=> ( unequally_directed_lines(X2,X3)
& unequally_directed_lines(X2,reverse_line(X3)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.tEMTL3rq4w/E---3.1_29839.p',con_def) ).
fof(c_0_4,negated_conjecture,
~ ! [X2,X3,X6,X1,X4,X5] :
( ( between_on_line(X2,X1,X4,X5)
& convergent_lines(X2,X3)
& ~ apart_point_and_line(X4,X3)
& convergent_lines(X2,X6)
& convergent_lines(X3,X6)
& ~ apart_point_and_line(X4,X6) )
=> between_on_line(X3,intersection_point(X3,parallel_through_point(X6,X1)),X4,intersection_point(X3,parallel_through_point(X6,X5))) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[con])]) ).
fof(c_0_5,plain,
! [X62,X63] :
( ~ unequally_directed_lines(X62,X63)
| ~ unequally_directed_lines(X62,reverse_line(X63))
| left_convergent_lines(X62,X63)
| left_convergent_lines(X62,reverse_line(X63)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag9])]) ).
fof(c_0_6,plain,
! [X64,X65] :
( ~ left_convergent_lines(X64,X65)
& ~ left_convergent_lines(X64,reverse_line(X65)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag11])]) ).
fof(c_0_7,plain,
! [X31,X32] :
( ( unequally_directed_lines(X31,X32)
| ~ convergent_lines(X31,X32) )
& ( unequally_directed_lines(X31,reverse_line(X32))
| ~ convergent_lines(X31,X32) )
& ( ~ unequally_directed_lines(X31,X32)
| ~ unequally_directed_lines(X31,reverse_line(X32))
| convergent_lines(X31,X32) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[con_def])])]) ).
fof(c_0_8,negated_conjecture,
( between_on_line(esk1_0,esk4_0,esk5_0,esk6_0)
& convergent_lines(esk1_0,esk2_0)
& ~ apart_point_and_line(esk5_0,esk2_0)
& convergent_lines(esk1_0,esk3_0)
& convergent_lines(esk2_0,esk3_0)
& ~ apart_point_and_line(esk5_0,esk3_0)
& ~ between_on_line(esk2_0,intersection_point(esk2_0,parallel_through_point(esk3_0,esk4_0)),esk5_0,intersection_point(esk2_0,parallel_through_point(esk3_0,esk6_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
cnf(c_0_9,plain,
( left_convergent_lines(X1,X2)
| left_convergent_lines(X1,reverse_line(X2))
| ~ unequally_directed_lines(X1,X2)
| ~ unequally_directed_lines(X1,reverse_line(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
~ left_convergent_lines(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( unequally_directed_lines(X1,reverse_line(X2))
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
convergent_lines(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( unequally_directed_lines(X1,X2)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,plain,
( ~ unequally_directed_lines(X1,reverse_line(X2))
| ~ unequally_directed_lines(X1,X2) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_9,c_0_10]),c_0_10]) ).
cnf(c_0_15,negated_conjecture,
unequally_directed_lines(esk2_0,reverse_line(esk3_0)),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
unequally_directed_lines(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.11 % Problem : GEO262+1 : TPTP v8.1.2. Bugfixed v6.4.0.
% 0.08/0.12 % Command : run_E %s %d THM
% 0.10/0.32 % Computer : n002.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:07:30 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 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 --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.tEMTL3rq4w/E---3.1_29839.p
% 0.17/0.45 # Version: 3.1pre001
% 0.17/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.45 # Starting sh5l with 300s (1) cores
% 0.17/0.45 # new_bool_3 with pid 29918 completed with status 0
% 0.17/0.45 # Result found by new_bool_3
% 0.17/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.45 # Search class: FGHNF-FFMS21-SFFFFFNN
% 0.17/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.45 # SAT001_MinMin_p005000_rr_RG with pid 29921 completed with status 0
% 0.17/0.45 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.17/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.45 # Search class: FGHNF-FFMS21-SFFFFFNN
% 0.17/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.45 # Preprocessing time : 0.001 s
% 0.17/0.45 # Presaturation interreduction done
% 0.17/0.45
% 0.17/0.45 # Proof found!
% 0.17/0.45 # SZS status Theorem
% 0.17/0.45 # SZS output start CNFRefutation
% See solution above
% 0.17/0.45 # Parsed axioms : 32
% 0.17/0.45 # Removed by relevancy pruning/SinE : 6
% 0.17/0.45 # Initial clauses : 54
% 0.17/0.45 # Removed in clause preprocessing : 0
% 0.17/0.45 # Initial clauses in saturation : 54
% 0.17/0.45 # Processed clauses : 79
% 0.17/0.45 # ...of these trivial : 0
% 0.17/0.45 # ...subsumed : 16
% 0.17/0.45 # ...remaining for further processing : 63
% 0.17/0.45 # Other redundant clauses eliminated : 0
% 0.17/0.45 # Clauses deleted for lack of memory : 0
% 0.17/0.45 # Backward-subsumed : 8
% 0.17/0.45 # Backward-rewritten : 0
% 0.17/0.45 # Generated clauses : 11
% 0.17/0.45 # ...of the previous two non-redundant : 10
% 0.17/0.45 # ...aggressively subsumed : 0
% 0.17/0.45 # Contextual simplify-reflections : 0
% 0.17/0.45 # Paramodulations : 11
% 0.17/0.45 # Factorizations : 0
% 0.17/0.45 # NegExts : 0
% 0.17/0.45 # Equation resolutions : 0
% 0.17/0.45 # Total rewrite steps : 1
% 0.17/0.45 # Propositional unsat checks : 0
% 0.17/0.45 # Propositional check models : 0
% 0.17/0.45 # Propositional check unsatisfiable : 0
% 0.17/0.45 # Propositional clauses : 0
% 0.17/0.45 # Propositional clauses after purity: 0
% 0.17/0.45 # Propositional unsat core size : 0
% 0.17/0.45 # Propositional preprocessing time : 0.000
% 0.17/0.45 # Propositional encoding time : 0.000
% 0.17/0.45 # Propositional solver time : 0.000
% 0.17/0.45 # Success case prop preproc time : 0.000
% 0.17/0.45 # Success case prop encoding time : 0.000
% 0.17/0.45 # Success case prop solver time : 0.000
% 0.17/0.45 # Current number of processed clauses : 25
% 0.17/0.45 # Positive orientable unit clauses : 8
% 0.17/0.45 # Positive unorientable unit clauses: 0
% 0.17/0.45 # Negative unit clauses : 8
% 0.17/0.45 # Non-unit-clauses : 9
% 0.17/0.45 # Current number of unprocessed clauses: 14
% 0.17/0.45 # ...number of literals in the above : 36
% 0.17/0.45 # Current number of archived formulas : 0
% 0.17/0.45 # Current number of archived clauses : 38
% 0.17/0.45 # Clause-clause subsumption calls (NU) : 77
% 0.17/0.45 # Rec. Clause-clause subsumption calls : 51
% 0.17/0.45 # Non-unit clause-clause subsumptions : 6
% 0.17/0.45 # Unit Clause-clause subsumption calls : 38
% 0.17/0.45 # Rewrite failures with RHS unbound : 0
% 0.17/0.45 # BW rewrite match attempts : 0
% 0.17/0.45 # BW rewrite match successes : 0
% 0.17/0.45 # Condensation attempts : 0
% 0.17/0.45 # Condensation successes : 0
% 0.17/0.45 # Termbank termtop insertions : 3132
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.008 s
% 0.17/0.45 # System time : 0.000 s
% 0.17/0.45 # Total time : 0.008 s
% 0.17/0.45 # Maximum resident set size: 1876 pages
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.008 s
% 0.17/0.45 # System time : 0.003 s
% 0.17/0.45 # Total time : 0.011 s
% 0.17/0.45 # Maximum resident set size: 1716 pages
% 0.17/0.45 % E---3.1 exiting
% 0.17/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------