TSTP Solution File: GEO263+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GEO263+1 : TPTP v8.1.2. Bugfixed v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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:42 EDT 2023
% Result : Theorem 0.19s 0.50s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 5 unt; 0 def)
% Number of atoms : 52 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 52 ( 18 ~; 15 |; 15 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 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)
& convergent_lines(X2,X6)
& convergent_lines(X3,X6) )
=> between_on_line(X3,intersection_point(X3,parallel_through_point(X6,X1)),intersection_point(X3,parallel_through_point(X6,X4)),intersection_point(X3,parallel_through_point(X6,X5))) ),
file('/export/starexec/sandbox/tmp/tmp.48jTkIA9tw/E---3.1_27107.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/sandbox/tmp/tmp.48jTkIA9tw/E---3.1_27107.p',oag9) ).
fof(oag11,axiom,
! [X2,X3] :
~ ( left_convergent_lines(X2,X3)
| left_convergent_lines(X2,reverse_line(X3)) ),
file('/export/starexec/sandbox/tmp/tmp.48jTkIA9tw/E---3.1_27107.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/sandbox/tmp/tmp.48jTkIA9tw/E---3.1_27107.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)
& convergent_lines(X2,X6)
& convergent_lines(X3,X6) )
=> between_on_line(X3,intersection_point(X3,parallel_through_point(X6,X1)),intersection_point(X3,parallel_through_point(X6,X4)),intersection_point(X3,parallel_through_point(X6,X5))) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_5,plain,
! [X43,X44] :
( ~ unequally_directed_lines(X43,X44)
| ~ unequally_directed_lines(X43,reverse_line(X44))
| left_convergent_lines(X43,X44)
| left_convergent_lines(X43,reverse_line(X44)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag9])]) ).
fof(c_0_6,plain,
! [X57,X58] :
( ~ left_convergent_lines(X57,X58)
& ~ left_convergent_lines(X57,reverse_line(X58)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag11])]) ).
fof(c_0_7,plain,
! [X27,X28] :
( ( unequally_directed_lines(X27,X28)
| ~ convergent_lines(X27,X28) )
& ( unequally_directed_lines(X27,reverse_line(X28))
| ~ convergent_lines(X27,X28) )
& ( ~ unequally_directed_lines(X27,X28)
| ~ unequally_directed_lines(X27,reverse_line(X28))
| convergent_lines(X27,X28) ) ),
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)
& convergent_lines(esk1_0,esk3_0)
& convergent_lines(esk2_0,esk3_0)
& ~ between_on_line(esk2_0,intersection_point(esk2_0,parallel_through_point(esk3_0,esk4_0)),intersection_point(esk2_0,parallel_through_point(esk3_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.03/0.12 % Problem : GEO263+1 : TPTP v8.1.2. Bugfixed v6.4.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n012.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Oct 3 06:34:20 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.19/0.48 Running first-order model finding
% 0.19/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.48jTkIA9tw/E---3.1_27107.p
% 0.19/0.50 # Version: 3.1pre001
% 0.19/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 # Starting sh5l with 300s (1) cores
% 0.19/0.50 # sh5l with pid 27187 completed with status 0
% 0.19/0.50 # Result found by sh5l
% 0.19/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 # Starting sh5l with 300s (1) cores
% 0.19/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.50 # Search class: FGHNF-FFMS21-SFFFFFNN
% 0.19/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.50 # SAT001_MinMin_p005000_rr_RG with pid 27189 completed with status 0
% 0.19/0.50 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 # Starting sh5l with 300s (1) cores
% 0.19/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.50 # Search class: FGHNF-FFMS21-SFFFFFNN
% 0.19/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.50 # Preprocessing time : 0.001 s
% 0.19/0.50 # Presaturation interreduction done
% 0.19/0.50
% 0.19/0.50 # Proof found!
% 0.19/0.50 # SZS status Theorem
% 0.19/0.50 # SZS output start CNFRefutation
% See solution above
% 0.19/0.50 # Parsed axioms : 32
% 0.19/0.50 # Removed by relevancy pruning/SinE : 1
% 0.19/0.50 # Initial clauses : 57
% 0.19/0.50 # Removed in clause preprocessing : 0
% 0.19/0.50 # Initial clauses in saturation : 57
% 0.19/0.50 # Processed clauses : 82
% 0.19/0.50 # ...of these trivial : 0
% 0.19/0.50 # ...subsumed : 16
% 0.19/0.50 # ...remaining for further processing : 66
% 0.19/0.50 # Other redundant clauses eliminated : 0
% 0.19/0.50 # Clauses deleted for lack of memory : 0
% 0.19/0.50 # Backward-subsumed : 7
% 0.19/0.50 # Backward-rewritten : 0
% 0.19/0.50 # Generated clauses : 7
% 0.19/0.50 # ...of the previous two non-redundant : 6
% 0.19/0.50 # ...aggressively subsumed : 0
% 0.19/0.50 # Contextual simplify-reflections : 0
% 0.19/0.50 # Paramodulations : 7
% 0.19/0.50 # Factorizations : 0
% 0.19/0.50 # NegExts : 0
% 0.19/0.50 # Equation resolutions : 0
% 0.19/0.50 # Total rewrite steps : 1
% 0.19/0.50 # Propositional unsat checks : 0
% 0.19/0.50 # Propositional check models : 0
% 0.19/0.50 # Propositional check unsatisfiable : 0
% 0.19/0.50 # Propositional clauses : 0
% 0.19/0.50 # Propositional clauses after purity: 0
% 0.19/0.50 # Propositional unsat core size : 0
% 0.19/0.50 # Propositional preprocessing time : 0.000
% 0.19/0.50 # Propositional encoding time : 0.000
% 0.19/0.50 # Propositional solver time : 0.000
% 0.19/0.50 # Success case prop preproc time : 0.000
% 0.19/0.50 # Success case prop encoding time : 0.000
% 0.19/0.50 # Success case prop solver time : 0.000
% 0.19/0.50 # Current number of processed clauses : 25
% 0.19/0.50 # Positive orientable unit clauses : 8
% 0.19/0.50 # Positive unorientable unit clauses: 0
% 0.19/0.50 # Negative unit clauses : 10
% 0.19/0.50 # Non-unit-clauses : 7
% 0.19/0.50 # Current number of unprocessed clauses: 15
% 0.19/0.50 # ...number of literals in the above : 42
% 0.19/0.50 # Current number of archived formulas : 0
% 0.19/0.50 # Current number of archived clauses : 41
% 0.19/0.50 # Clause-clause subsumption calls (NU) : 136
% 0.19/0.50 # Rec. Clause-clause subsumption calls : 98
% 0.19/0.50 # Non-unit clause-clause subsumptions : 6
% 0.19/0.50 # Unit Clause-clause subsumption calls : 60
% 0.19/0.50 # Rewrite failures with RHS unbound : 0
% 0.19/0.50 # BW rewrite match attempts : 0
% 0.19/0.50 # BW rewrite match successes : 0
% 0.19/0.50 # Condensation attempts : 0
% 0.19/0.50 # Condensation successes : 0
% 0.19/0.50 # Termbank termtop insertions : 3382
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.007 s
% 0.19/0.50 # System time : 0.001 s
% 0.19/0.50 # Total time : 0.008 s
% 0.19/0.50 # Maximum resident set size: 1880 pages
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.010 s
% 0.19/0.50 # System time : 0.002 s
% 0.19/0.50 # Total time : 0.012 s
% 0.19/0.50 # Maximum resident set size: 1716 pages
% 0.19/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------