TSTP Solution File: GEO261+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : GEO261+1 : TPTP v6.4.0. Bugfixed v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n021.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 16091.75MB
% OS : Linux 3.10.0-327.10.1.el7.x86_64
% CPULimit : 300s
% DateTime : Fri Apr 1 13:39:18 EDT 2016
% Result : Theorem 184.64s
% Output : CNFRefutation 184.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 29 ( 8 unt; 0 def)
% Number of atoms : 85 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 96 ( 40 ~; 26 |; 25 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 57 ( 2 sgn 35 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(5,axiom,
! [X1,X4] :
( ( unequally_directed_lines(X1,X4)
& unequally_directed_lines(X1,reverse_line(X4)) )
=> ( left_convergent_lines(X1,X4)
| left_convergent_lines(X1,reverse_line(X4)) ) ),
file('/export/starexec/sandbox2/tmp/tmpEQg1GH/sel_theBenchmark.p_4',oag9) ).
fof(14,axiom,
! [X1,X4] :
( convergent_lines(X1,X4)
<=> ( unequally_directed_lines(X1,X4)
& unequally_directed_lines(X1,reverse_line(X4)) ) ),
file('/export/starexec/sandbox2/tmp/tmpEQg1GH/sel_theBenchmark.p_4',con_def) ).
fof(25,axiom,
! [X1,X4] :
~ ( left_convergent_lines(X1,X4)
| left_convergent_lines(X1,reverse_line(X4)) ),
file('/export/starexec/sandbox2/tmp/tmpEQg1GH/sel_theBenchmark.p_4',oag11) ).
fof(27,conjecture,
! [X1,X4,X2,X3,X6] :
( ( between_on_line(X1,X2,X3,X6)
& convergent_lines(X1,X4)
& ~ apart_point_and_line(X3,X4) )
=> divides_points(X4,X2,X6) ),
file('/export/starexec/sandbox2/tmp/tmpEQg1GH/sel_theBenchmark.p_4',con) ).
fof(28,negated_conjecture,
~ ! [X1,X4,X2,X3,X6] :
( ( between_on_line(X1,X2,X3,X6)
& convergent_lines(X1,X4)
& ~ apart_point_and_line(X3,X4) )
=> divides_points(X4,X2,X6) ),
inference(assume_negation,[status(cth)],[27]) ).
fof(37,negated_conjecture,
~ ! [X1,X4,X2,X3,X6] :
( ( between_on_line(X1,X2,X3,X6)
& convergent_lines(X1,X4)
& ~ apart_point_and_line(X3,X4) )
=> divides_points(X4,X2,X6) ),
inference(fof_simplification,[status(thm)],[28,theory(equality)]) ).
fof(56,plain,
! [X1,X4] :
( ~ unequally_directed_lines(X1,X4)
| ~ unequally_directed_lines(X1,reverse_line(X4))
| left_convergent_lines(X1,X4)
| left_convergent_lines(X1,reverse_line(X4)) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(57,plain,
! [X5,X6] :
( ~ unequally_directed_lines(X5,X6)
| ~ unequally_directed_lines(X5,reverse_line(X6))
| left_convergent_lines(X5,X6)
| left_convergent_lines(X5,reverse_line(X6)) ),
inference(variable_rename,[status(thm)],[56]) ).
cnf(58,plain,
( left_convergent_lines(X1,reverse_line(X2))
| left_convergent_lines(X1,X2)
| ~ unequally_directed_lines(X1,reverse_line(X2))
| ~ unequally_directed_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[57]) ).
fof(88,plain,
! [X1,X4] :
( ( ~ convergent_lines(X1,X4)
| ( unequally_directed_lines(X1,X4)
& unequally_directed_lines(X1,reverse_line(X4)) ) )
& ( ~ unequally_directed_lines(X1,X4)
| ~ unequally_directed_lines(X1,reverse_line(X4))
| convergent_lines(X1,X4) ) ),
inference(fof_nnf,[status(thm)],[14]) ).
fof(89,plain,
! [X5,X6] :
( ( ~ convergent_lines(X5,X6)
| ( unequally_directed_lines(X5,X6)
& unequally_directed_lines(X5,reverse_line(X6)) ) )
& ( ~ unequally_directed_lines(X5,X6)
| ~ unequally_directed_lines(X5,reverse_line(X6))
| convergent_lines(X5,X6) ) ),
inference(variable_rename,[status(thm)],[88]) ).
fof(90,plain,
! [X5,X6] :
( ( unequally_directed_lines(X5,X6)
| ~ convergent_lines(X5,X6) )
& ( unequally_directed_lines(X5,reverse_line(X6))
| ~ convergent_lines(X5,X6) )
& ( ~ unequally_directed_lines(X5,X6)
| ~ unequally_directed_lines(X5,reverse_line(X6))
| convergent_lines(X5,X6) ) ),
inference(distribute,[status(thm)],[89]) ).
cnf(92,plain,
( unequally_directed_lines(X1,reverse_line(X2))
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[90]) ).
cnf(93,plain,
( unequally_directed_lines(X1,X2)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[90]) ).
fof(138,plain,
! [X1,X4] :
( ~ left_convergent_lines(X1,X4)
& ~ left_convergent_lines(X1,reverse_line(X4)) ),
inference(fof_nnf,[status(thm)],[25]) ).
fof(139,plain,
! [X5,X6] :
( ~ left_convergent_lines(X5,X6)
& ~ left_convergent_lines(X5,reverse_line(X6)) ),
inference(variable_rename,[status(thm)],[138]) ).
cnf(141,plain,
~ left_convergent_lines(X1,X2),
inference(split_conjunct,[status(thm)],[139]) ).
fof(146,negated_conjecture,
? [X1,X4,X2,X3,X6] :
( between_on_line(X1,X2,X3,X6)
& convergent_lines(X1,X4)
& ~ apart_point_and_line(X3,X4)
& ~ divides_points(X4,X2,X6) ),
inference(fof_nnf,[status(thm)],[37]) ).
fof(147,negated_conjecture,
? [X7,X8,X9,X10,X11] :
( between_on_line(X7,X9,X10,X11)
& convergent_lines(X7,X8)
& ~ apart_point_and_line(X10,X8)
& ~ divides_points(X8,X9,X11) ),
inference(variable_rename,[status(thm)],[146]) ).
fof(148,negated_conjecture,
( between_on_line(esk1_0,esk3_0,esk4_0,esk5_0)
& convergent_lines(esk1_0,esk2_0)
& ~ apart_point_and_line(esk4_0,esk2_0)
& ~ divides_points(esk2_0,esk3_0,esk5_0) ),
inference(skolemize,[status(esa)],[147]) ).
cnf(151,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[148]) ).
cnf(153,negated_conjecture,
unequally_directed_lines(esk1_0,esk2_0),
inference(spm,[status(thm)],[93,151,theory(equality)]) ).
cnf(156,negated_conjecture,
unequally_directed_lines(esk1_0,reverse_line(esk2_0)),
inference(spm,[status(thm)],[92,151,theory(equality)]) ).
cnf(194,plain,
( left_convergent_lines(X1,reverse_line(X2))
| ~ unequally_directed_lines(X1,X2)
| ~ unequally_directed_lines(X1,reverse_line(X2)) ),
inference(sr,[status(thm)],[58,141,theory(equality)]) ).
cnf(195,plain,
( ~ unequally_directed_lines(X1,X2)
| ~ unequally_directed_lines(X1,reverse_line(X2)) ),
inference(sr,[status(thm)],[194,141,theory(equality)]) ).
cnf(210,negated_conjecture,
~ unequally_directed_lines(esk1_0,esk2_0),
inference(spm,[status(thm)],[195,156,theory(equality)]) ).
cnf(211,negated_conjecture,
$false,
inference(rw,[status(thm)],[210,153,theory(equality)]) ).
cnf(212,negated_conjecture,
$false,
inference(cn,[status(thm)],[211,theory(equality)]) ).
cnf(213,negated_conjecture,
$false,
212,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO261+1 : TPTP v6.4.0. Bugfixed v6.4.0.
% 0.00/0.03 % Command : Source/sine.py -e eprover -t %d %s
% 0.02/0.23 % Computer : n021.star.cs.uiowa.edu
% 0.02/0.23 % Model : x86_64 x86_64
% 0.02/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.23 % Memory : 16091.75MB
% 0.02/0.23 % OS : Linux 3.10.0-327.10.1.el7.x86_64
% 0.02/0.23 % CPULimit : 300
% 0.02/0.23 % DateTime : Fri Apr 1 11:32:23 CDT 2016
% 0.02/0.23 % CPUTime :
% 0.02/0.27 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.02/0.27 --creating new selector for [GEO007+0.ax]
% 29.08/29.44 eprover: CPU time limit exceeded, terminating
% 109.20/111.38 eprover: CPU time limit exceeded, terminating
% 109.42/112.45 -running prover on /export/starexec/sandbox2/tmp/tmpEQg1GH/sel_theBenchmark.p_1 with time limit 29
% 109.42/112.45 -running prover with command ['/export/starexec/sandbox2/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/export/starexec/sandbox2/tmp/tmpEQg1GH/sel_theBenchmark.p_1']
% 109.42/112.45 -prover status ResourceOut
% 109.42/112.45 -running prover on /export/starexec/sandbox2/tmp/tmpEQg1GH/sel_theBenchmark.p_2 with time limit 80
% 109.42/112.45 -running prover with command ['/export/starexec/sandbox2/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=80', '/export/starexec/sandbox2/tmp/tmpEQg1GH/sel_theBenchmark.p_2']
% 109.42/112.45 -prover status ResourceOut
% 109.42/112.45 --creating new selector for [GEO007+0.ax]
% 184.44/188.97 eprover: CPU time limit exceeded, terminating
% 184.64/189.63 -running prover on /export/starexec/sandbox2/tmp/tmpEQg1GH/sel_theBenchmark.p_3 with time limit 75
% 184.64/189.63 -running prover with command ['/export/starexec/sandbox2/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=75', '/export/starexec/sandbox2/tmp/tmpEQg1GH/sel_theBenchmark.p_3']
% 184.64/189.63 -prover status ResourceOut
% 184.64/189.63 --creating new selector for [GEO007+0.ax]
% 184.64/189.70 -running prover on /export/starexec/sandbox2/tmp/tmpEQg1GH/sel_theBenchmark.p_4 with time limit 55
% 184.64/189.70 -running prover with command ['/export/starexec/sandbox2/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=55', '/export/starexec/sandbox2/tmp/tmpEQg1GH/sel_theBenchmark.p_4']
% 184.64/189.70 -prover status Theorem
% 184.64/189.70 Problem theBenchmark.p solved in phase 3.
% 184.64/189.70 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 184.64/189.70 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 184.64/189.70 Solved 1 out of 1.
% 184.64/189.70 # Problem is unsatisfiable (or provable), constructing proof object
% 184.64/189.70 # SZS status Theorem
% 184.64/189.70 # SZS output start CNFRefutation.
% See solution above
% 184.73/189.70 # SZS output end CNFRefutation
%------------------------------------------------------------------------------