%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : GEO238+1 : TPTP v6.4.0. Bugfixed v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n023.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:16 EDT 2016
% Result : Theorem 0.06s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 5 unt; 0 def)
% Number of atoms : 77 ( 0 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 89 ( 32 ~; 27 |; 26 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 49 ( 7 sgn 30 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(3,axiom,
! [X1,X4] :
~ ( left_apart_point(X1,X4)
| left_apart_point(X1,reverse_line(X4)) ),
file('/export/starexec/sandbox/tmp/tmpVKsXIn/sel_theBenchmark.p_1',oag10) ).
fof(4,axiom,
! [X1,X2,X4] :
( divides_points(X4,X1,X2)
<=> ( ( left_apart_point(X1,X4)
& left_apart_point(X2,reverse_line(X4)) )
| ( left_apart_point(X1,reverse_line(X4))
& left_apart_point(X2,X4) ) ) ),
file('/export/starexec/sandbox/tmp/tmpVKsXIn/sel_theBenchmark.p_1',div_def) ).
fof(6,conjecture,
! [X1,X2,X3,X4] :
( ( divides_points(X4,X1,X2)
& divides_points(X4,X1,X3) )
=> ~ divides_points(X4,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmpVKsXIn/sel_theBenchmark.p_1',con) ).
fof(7,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ( divides_points(X4,X1,X2)
& divides_points(X4,X1,X3) )
=> ~ divides_points(X4,X2,X3) ),
inference(assume_negation,[status(cth)],[6]) ).
fof(9,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ( divides_points(X4,X1,X2)
& divides_points(X4,X1,X3) )
=> ~ divides_points(X4,X2,X3) ),
inference(fof_simplification,[status(thm)],[7,theory(equality)]) ).
fof(15,plain,
! [X1,X4] :
( ~ left_apart_point(X1,X4)
& ~ left_apart_point(X1,reverse_line(X4)) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(16,plain,
! [X5,X6] :
( ~ left_apart_point(X5,X6)
& ~ left_apart_point(X5,reverse_line(X6)) ),
inference(variable_rename,[status(thm)],[15]) ).
cnf(18,plain,
~ left_apart_point(X1,X2),
inference(split_conjunct,[status(thm)],[16]) ).
fof(19,plain,
! [X1,X2,X4] :
( ( ~ divides_points(X4,X1,X2)
| ( left_apart_point(X1,X4)
& left_apart_point(X2,reverse_line(X4)) )
| ( left_apart_point(X1,reverse_line(X4))
& left_apart_point(X2,X4) ) )
& ( ( ( ~ left_apart_point(X1,X4)
| ~ left_apart_point(X2,reverse_line(X4)) )
& ( ~ left_apart_point(X1,reverse_line(X4))
| ~ left_apart_point(X2,X4) ) )
| divides_points(X4,X1,X2) ) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(20,plain,
! [X5,X6,X7] :
( ( ~ divides_points(X7,X5,X6)
| ( left_apart_point(X5,X7)
& left_apart_point(X6,reverse_line(X7)) )
| ( left_apart_point(X5,reverse_line(X7))
& left_apart_point(X6,X7) ) )
& ( ( ( ~ left_apart_point(X5,X7)
| ~ left_apart_point(X6,reverse_line(X7)) )
& ( ~ left_apart_point(X5,reverse_line(X7))
| ~ left_apart_point(X6,X7) ) )
| divides_points(X7,X5,X6) ) ),
inference(variable_rename,[status(thm)],[19]) ).
fof(21,plain,
! [X5,X6,X7] :
( ( left_apart_point(X5,reverse_line(X7))
| left_apart_point(X5,X7)
| ~ divides_points(X7,X5,X6) )
& ( left_apart_point(X6,X7)
| left_apart_point(X5,X7)
| ~ divides_points(X7,X5,X6) )
& ( left_apart_point(X5,reverse_line(X7))
| left_apart_point(X6,reverse_line(X7))
| ~ divides_points(X7,X5,X6) )
& ( left_apart_point(X6,X7)
| left_apart_point(X6,reverse_line(X7))
| ~ divides_points(X7,X5,X6) )
& ( ~ left_apart_point(X5,X7)
| ~ left_apart_point(X6,reverse_line(X7))
| divides_points(X7,X5,X6) )
& ( ~ left_apart_point(X5,reverse_line(X7))
| ~ left_apart_point(X6,X7)
| divides_points(X7,X5,X6) ) ),
inference(distribute,[status(thm)],[20]) ).
cnf(24,plain,
( left_apart_point(X3,reverse_line(X1))
| left_apart_point(X3,X1)
| ~ divides_points(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[21]) ).
fof(31,negated_conjecture,
? [X1,X2,X3,X4] :
( divides_points(X4,X1,X2)
& divides_points(X4,X1,X3)
& divides_points(X4,X2,X3) ),
inference(fof_nnf,[status(thm)],[9]) ).
fof(32,negated_conjecture,
? [X5,X6,X7,X8] :
( divides_points(X8,X5,X6)
& divides_points(X8,X5,X7)
& divides_points(X8,X6,X7) ),
inference(variable_rename,[status(thm)],[31]) ).
fof(33,negated_conjecture,
( divides_points(esk4_0,esk1_0,esk2_0)
& divides_points(esk4_0,esk1_0,esk3_0)
& divides_points(esk4_0,esk2_0,esk3_0) ),
inference(skolemize,[status(esa)],[32]) ).
cnf(36,negated_conjecture,
divides_points(esk4_0,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[33]) ).
cnf(40,plain,
( left_apart_point(X3,reverse_line(X1))
| ~ divides_points(X1,X2,X3) ),
inference(sr,[status(thm)],[24,18,theory(equality)]) ).
cnf(41,plain,
~ divides_points(X1,X2,X3),
inference(sr,[status(thm)],[40,18,theory(equality)]) ).
cnf(42,negated_conjecture,
$false,
inference(sr,[status(thm)],[36,41,theory(equality)]) ).
cnf(43,negated_conjecture,
$false,
42,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO238+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.22 % Computer : n023.star.cs.uiowa.edu
% 0.02/0.22 % Model : x86_64 x86_64
% 0.02/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.22 % Memory : 16091.75MB
% 0.02/0.22 % OS : Linux 3.10.0-327.10.1.el7.x86_64
% 0.02/0.22 % CPULimit : 300
% 0.02/0.22 % DateTime : Fri Apr 1 11:16:08 CDT 2016
% 0.02/0.23 % CPUTime :
% 0.06/0.30 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.30 --creating new selector for [GEO007+0.ax]
% 0.06/0.37 -running prover on /export/starexec/sandbox/tmp/tmpVKsXIn/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.37 -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/tmpVKsXIn/sel_theBenchmark.p_1']
% 0.06/0.37 -prover status Theorem
% 0.06/0.37 Problem theBenchmark.p solved in phase 0.
% 0.06/0.37 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.37 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.37 Solved 1 out of 1.
% 0.06/0.37 # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.37 # SZS status Theorem
% 0.06/0.37 # SZS output start CNFRefutation.
% See solution above
% 0.06/0.37 # SZS output end CNFRefutation
%------------------------------------------------------------------------------