%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : GEO171+2 : TPTP v9.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n017.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 : 300s
% WCLimit : 300s
% DateTime : Wed Apr 9 06:13:59 PM UTC 2025
% Result : Theorem 3.06s 1.65s
% Output : CNFRefutation 3.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 2
% Syntax : Number of formulae : 7 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 10 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 4 ~; 1 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 6 ( 6 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ distinct_points > distinct_lines > convergent_lines > apart_point_and_line > line_connecting > intersection_point > #nlpp > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(line_connecting,type,
line_connecting: ( $i * $i ) > $i ).
tff(distinct_points,type,
distinct_points: ( $i * $i ) > $o ).
tff(intersection_point,type,
intersection_point: ( $i * $i ) > $i ).
tff(apart_point_and_line,type,
apart_point_and_line: ( $i * $i ) > $o ).
tff(convergent_lines,type,
convergent_lines: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(distinct_lines,type,
distinct_lines: ( $i * $i ) > $o ).
tff(f_134,negated_conjecture,
~ ! [X,Y] :
( convergent_lines(X,Y)
=> distinct_lines(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
tff(f_127,axiom,
! [X,Y] :
( convergent_lines(X,Y)
=> distinct_lines(X,Y) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO008+0.ax',ceq3) ).
tff(c_32,plain,
convergent_lines('#skF_1','#skF_2'),
inference(cnfTransformation,[status(thm)],[f_134]) ).
tff(c_36,plain,
! [X_34,Y_35] :
( distinct_lines(X_34,Y_35)
| ~ convergent_lines(X_34,Y_35) ),
inference(cnfTransformation,[status(thm)],[f_127]) ).
tff(c_30,plain,
~ distinct_lines('#skF_1','#skF_2'),
inference(cnfTransformation,[status(thm)],[f_134]) ).
tff(c_43,plain,
~ convergent_lines('#skF_1','#skF_2'),
inference(resolution,[status(thm)],[c_36,c_30]) ).
tff(c_48,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_32,c_43]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO171+2 : TPTP v9.0.0. Released v3.3.0.
% 0.03/0.13 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.13/0.34 % Computer : n017.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Apr 7 19:53:25 EDT 2025
% 0.13/0.34 % CPUTime :
% 3.06/1.65 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.06/1.65
% 3.06/1.65 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------