TSTP Solution File: GEO260+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : GEO260+1 : TPTP v6.4.0. Bugfixed v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n009.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 : Mon Apr 4 14:22:27 EDT 2016
% Result : Theorem 184.75s
% Output : CNFRefutation 184.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 7
% Syntax : Number of formulae : 52 ( 17 unt; 0 def)
% Number of atoms : 132 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 121 ( 41 ~; 48 |; 27 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 104 ( 18 sgn 52 !; 16 ?)
% 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/sandbox/tmp/tmp6rkcfW/sel_theBenchmark.p_4',oag9) ).
fof(6,axiom,
! [X1,X4] :
( ( line(X1)
& line(X4) )
=> ( unequally_directed_lines(X1,X4)
| unequally_directed_lines(X1,reverse_line(X4)) ) ),
file('/export/starexec/sandbox/tmp/tmp6rkcfW/sel_theBenchmark.p_4',oag8) ).
fof(7,axiom,
! [X1] : ~ unequally_directed_lines(X1,X1),
file('/export/starexec/sandbox/tmp/tmp6rkcfW/sel_theBenchmark.p_4',oag5) ).
fof(9,axiom,
! [X1,X4,X5] :
( unequally_directed_lines(X1,X4)
=> ( unequally_directed_lines(X1,X5)
| unequally_directed_lines(X4,X5) ) ),
file('/export/starexec/sandbox/tmp/tmp6rkcfW/sel_theBenchmark.p_4',oag6) ).
fof(21,axiom,
! [X2,X3] : ~ unequally_directed_lines(line_connecting(X2,X3),reverse_line(line_connecting(X3,X2))),
file('/export/starexec/sandbox/tmp/tmp6rkcfW/sel_theBenchmark.p_4',oagco9) ).
fof(23,axiom,
! [X1,X4] :
~ ( left_convergent_lines(X1,X4)
| left_convergent_lines(X1,reverse_line(X4)) ),
file('/export/starexec/sandbox/tmp/tmp6rkcfW/sel_theBenchmark.p_4',oag11) ).
fof(25,conjecture,
! [X1,X2,X3,X6,X1,X2,X3,X6] :
( ( line(X1)
& distinct_points(X2,X6)
& distinct_points(X3,X6)
& distinct_points(X2,X3) )
=> ~ ( between_on_line(X1,X2,X3,X6)
& between_on_line(X1,X2,X6,X3) ) ),
file('/export/starexec/sandbox/tmp/tmp6rkcfW/sel_theBenchmark.p_4',con) ).
fof(26,negated_conjecture,
~ ! [X1,X2,X3,X6,X1,X2,X3,X6] :
( ( line(X1)
& distinct_points(X2,X6)
& distinct_points(X3,X6)
& distinct_points(X2,X3) )
=> ~ ( between_on_line(X1,X2,X3,X6)
& between_on_line(X1,X2,X6,X3) ) ),
inference(assume_negation,[status(cth)],[25]) ).
fof(29,plain,
! [X1] : ~ unequally_directed_lines(X1,X1),
inference(fof_simplification,[status(thm)],[7,theory(equality)]) ).
fof(34,plain,
! [X2,X3] : ~ unequally_directed_lines(line_connecting(X2,X3),reverse_line(line_connecting(X3,X2))),
inference(fof_simplification,[status(thm)],[21,theory(equality)]) ).
fof(53,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(54,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)],[53]) ).
cnf(55,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)],[54]) ).
fof(56,plain,
! [X1,X4] :
( ~ line(X1)
| ~ line(X4)
| unequally_directed_lines(X1,X4)
| unequally_directed_lines(X1,reverse_line(X4)) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(57,plain,
! [X5,X6] :
( ~ line(X5)
| ~ line(X6)
| unequally_directed_lines(X5,X6)
| unequally_directed_lines(X5,reverse_line(X6)) ),
inference(variable_rename,[status(thm)],[56]) ).
cnf(58,plain,
( unequally_directed_lines(X1,reverse_line(X2))
| unequally_directed_lines(X1,X2)
| ~ line(X2)
| ~ line(X1) ),
inference(split_conjunct,[status(thm)],[57]) ).
fof(59,plain,
! [X2] : ~ unequally_directed_lines(X2,X2),
inference(variable_rename,[status(thm)],[29]) ).
cnf(60,plain,
~ unequally_directed_lines(X1,X1),
inference(split_conjunct,[status(thm)],[59]) ).
fof(68,plain,
! [X1,X4,X5] :
( ~ unequally_directed_lines(X1,X4)
| unequally_directed_lines(X1,X5)
| unequally_directed_lines(X4,X5) ),
inference(fof_nnf,[status(thm)],[9]) ).
fof(69,plain,
! [X6,X7,X8] :
( ~ unequally_directed_lines(X6,X7)
| unequally_directed_lines(X6,X8)
| unequally_directed_lines(X7,X8) ),
inference(variable_rename,[status(thm)],[68]) ).
cnf(70,plain,
( unequally_directed_lines(X1,X2)
| unequally_directed_lines(X3,X2)
| ~ unequally_directed_lines(X3,X1) ),
inference(split_conjunct,[status(thm)],[69]) ).
fof(109,plain,
! [X4,X5] : ~ unequally_directed_lines(line_connecting(X4,X5),reverse_line(line_connecting(X5,X4))),
inference(variable_rename,[status(thm)],[34]) ).
cnf(110,plain,
~ unequally_directed_lines(line_connecting(X1,X2),reverse_line(line_connecting(X2,X1))),
inference(split_conjunct,[status(thm)],[109]) ).
fof(120,plain,
! [X1,X4] :
( ~ left_convergent_lines(X1,X4)
& ~ left_convergent_lines(X1,reverse_line(X4)) ),
inference(fof_nnf,[status(thm)],[23]) ).
fof(121,plain,
! [X5,X6] :
( ~ left_convergent_lines(X5,X6)
& ~ left_convergent_lines(X5,reverse_line(X6)) ),
inference(variable_rename,[status(thm)],[120]) ).
cnf(123,plain,
~ left_convergent_lines(X1,X2),
inference(split_conjunct,[status(thm)],[121]) ).
fof(128,negated_conjecture,
? [X1,X2,X3,X6,X1,X2,X3,X6] :
( line(X1)
& distinct_points(X2,X6)
& distinct_points(X3,X6)
& distinct_points(X2,X3)
& between_on_line(X1,X2,X3,X6)
& between_on_line(X1,X2,X6,X3) ),
inference(fof_nnf,[status(thm)],[26]) ).
fof(129,negated_conjecture,
? [X7,X8,X9,X10,X11,X12,X13,X14] :
( line(X11)
& distinct_points(X12,X14)
& distinct_points(X13,X14)
& distinct_points(X12,X13)
& between_on_line(X11,X12,X13,X14)
& between_on_line(X11,X12,X14,X13) ),
inference(variable_rename,[status(thm)],[128]) ).
fof(130,negated_conjecture,
( line(esk5_0)
& distinct_points(esk6_0,esk8_0)
& distinct_points(esk7_0,esk8_0)
& distinct_points(esk6_0,esk7_0)
& between_on_line(esk5_0,esk6_0,esk7_0,esk8_0)
& between_on_line(esk5_0,esk6_0,esk8_0,esk7_0) ),
inference(skolemize,[status(esa)],[129]) ).
cnf(136,negated_conjecture,
line(esk5_0),
inference(split_conjunct,[status(thm)],[130]) ).
cnf(141,negated_conjecture,
( unequally_directed_lines(X1,reverse_line(esk5_0))
| unequally_directed_lines(X1,esk5_0)
| ~ line(X1) ),
inference(spm,[status(thm)],[58,136,theory(equality)]) ).
cnf(167,plain,
( left_convergent_lines(X1,reverse_line(X2))
| ~ unequally_directed_lines(X1,X2)
| ~ unequally_directed_lines(X1,reverse_line(X2)) ),
inference(sr,[status(thm)],[55,123,theory(equality)]) ).
cnf(168,plain,
( ~ unequally_directed_lines(X1,X2)
| ~ unequally_directed_lines(X1,reverse_line(X2)) ),
inference(sr,[status(thm)],[167,123,theory(equality)]) ).
cnf(187,negated_conjecture,
( unequally_directed_lines(esk5_0,reverse_line(esk5_0))
| unequally_directed_lines(esk5_0,esk5_0) ),
inference(spm,[status(thm)],[141,136,theory(equality)]) ).
cnf(191,negated_conjecture,
unequally_directed_lines(esk5_0,reverse_line(esk5_0)),
inference(sr,[status(thm)],[187,60,theory(equality)]) ).
cnf(192,negated_conjecture,
( unequally_directed_lines(reverse_line(esk5_0),X1)
| unequally_directed_lines(esk5_0,X1) ),
inference(spm,[status(thm)],[70,191,theory(equality)]) ).
cnf(195,negated_conjecture,
( unequally_directed_lines(X1,X2)
| unequally_directed_lines(reverse_line(esk5_0),X2)
| unequally_directed_lines(esk5_0,X1) ),
inference(spm,[status(thm)],[70,192,theory(equality)]) ).
cnf(197,negated_conjecture,
( unequally_directed_lines(esk5_0,reverse_line(X1))
| ~ unequally_directed_lines(reverse_line(esk5_0),X1) ),
inference(spm,[status(thm)],[168,192,theory(equality)]) ).
cnf(204,negated_conjecture,
( unequally_directed_lines(reverse_line(esk5_0),reverse_line(line_connecting(X2,X1)))
| unequally_directed_lines(esk5_0,line_connecting(X1,X2)) ),
inference(spm,[status(thm)],[110,195,theory(equality)]) ).
cnf(211,negated_conjecture,
( unequally_directed_lines(reverse_line(esk5_0),reverse_line(X2))
| unequally_directed_lines(esk5_0,X1)
| ~ unequally_directed_lines(X1,X2) ),
inference(spm,[status(thm)],[168,195,theory(equality)]) ).
cnf(626,negated_conjecture,
( unequally_directed_lines(esk5_0,reverse_line(X1))
| unequally_directed_lines(esk5_0,X1) ),
inference(spm,[status(thm)],[197,192,theory(equality)]) ).
cnf(1098,negated_conjecture,
( unequally_directed_lines(reverse_line(esk5_0),reverse_line(reverse_line(X1)))
| unequally_directed_lines(esk5_0,esk5_0)
| unequally_directed_lines(esk5_0,X1) ),
inference(spm,[status(thm)],[211,626,theory(equality)]) ).
cnf(1124,negated_conjecture,
( unequally_directed_lines(reverse_line(esk5_0),reverse_line(reverse_line(X1)))
| unequally_directed_lines(esk5_0,X1) ),
inference(sr,[status(thm)],[1098,60,theory(equality)]) ).
cnf(1831,negated_conjecture,
( unequally_directed_lines(esk5_0,X1)
| ~ unequally_directed_lines(reverse_line(esk5_0),reverse_line(X1)) ),
inference(spm,[status(thm)],[168,1124,theory(equality)]) ).
cnf(1888,negated_conjecture,
( unequally_directed_lines(esk5_0,line_connecting(X1,X2))
| unequally_directed_lines(esk5_0,line_connecting(X2,X1)) ),
inference(spm,[status(thm)],[1831,204,theory(equality)]) ).
cnf(4518,negated_conjecture,
unequally_directed_lines(esk5_0,line_connecting(X3,X3)),
inference(ef,[status(thm)],[1888,theory(equality)]) ).
cnf(4530,negated_conjecture,
( unequally_directed_lines(line_connecting(X1,X1),X2)
| unequally_directed_lines(esk5_0,X2) ),
inference(spm,[status(thm)],[70,4518,theory(equality)]) ).
cnf(4553,negated_conjecture,
unequally_directed_lines(esk5_0,reverse_line(line_connecting(X1,X1))),
inference(spm,[status(thm)],[110,4530,theory(equality)]) ).
cnf(4617,negated_conjecture,
~ unequally_directed_lines(esk5_0,line_connecting(X1,X1)),
inference(spm,[status(thm)],[168,4553,theory(equality)]) ).
cnf(4620,negated_conjecture,
$false,
inference(rw,[status(thm)],[4617,4518,theory(equality)]) ).
cnf(4621,negated_conjecture,
$false,
inference(cn,[status(thm)],[4620,theory(equality)]) ).
cnf(4622,negated_conjecture,
$false,
4621,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO260+1 : TPTP v6.4.0. Bugfixed v6.4.0.
% 0.00/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.02/0.23 % Computer : n009.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 : Mon Apr 4 13:12:53 CDT 2016
% 0.02/0.23 % CPUTime :
% 0.02/0.27 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.02/0.27 --creating new selector for [GEO007+0.ax]
% 29.11/29.53 eprover: CPU time limit exceeded, terminating
% 109.24/110.87 eprover: CPU time limit exceeded, terminating
% 109.44/111.57 -running prover on /export/starexec/sandbox/tmp/tmp6rkcfW/sel_theBenchmark.p_1 with time limit 29
% 109.44/111.57 -running prover with command ['/export/starexec/sandbox/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/export/starexec/sandbox/tmp/tmp6rkcfW/sel_theBenchmark.p_1']
% 109.44/111.57 -prover status ResourceOut
% 109.44/111.57 -running prover on /export/starexec/sandbox/tmp/tmp6rkcfW/sel_theBenchmark.p_2 with time limit 80
% 109.44/111.57 -running prover with command ['/export/starexec/sandbox/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=80', '/export/starexec/sandbox/tmp/tmp6rkcfW/sel_theBenchmark.p_2']
% 109.44/111.57 -prover status ResourceOut
% 109.44/111.57 --creating new selector for [GEO007+0.ax]
% 184.47/186.84 eprover: CPU time limit exceeded, terminating
% 184.58/187.90 -running prover on /export/starexec/sandbox/tmp/tmp6rkcfW/sel_theBenchmark.p_3 with time limit 75
% 184.58/187.90 -running prover with command ['/export/starexec/sandbox/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=75', '/export/starexec/sandbox/tmp/tmp6rkcfW/sel_theBenchmark.p_3']
% 184.58/187.90 -prover status ResourceOut
% 184.58/187.90 --creating new selector for [GEO007+0.ax]
% 184.75/188.07 -running prover on /export/starexec/sandbox/tmp/tmp6rkcfW/sel_theBenchmark.p_4 with time limit 56
% 184.75/188.07 -running prover with command ['/export/starexec/sandbox/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=56', '/export/starexec/sandbox/tmp/tmp6rkcfW/sel_theBenchmark.p_4']
% 184.75/188.07 -prover status Theorem
% 184.75/188.07 Problem theBenchmark.p solved in phase 3.
% 184.75/188.07 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 184.75/188.07 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 184.75/188.07 Solved 1 out of 1.
% 184.75/188.07 # Problem is unsatisfiable (or provable), constructing proof object
% 184.75/188.07 # SZS status Theorem
% 184.75/188.07 # SZS output start CNFRefutation.
% See solution above
% 184.75/188.08 # SZS output end CNFRefutation
%------------------------------------------------------------------------------