TSTP Solution File: GEO179+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO179+2 : TPTP v8.1.2. 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 : n006.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 : Tue Aug 22 10:38:28 EDT 2023
% Result : Theorem 4.20s 2.03s
% Output : CNFRefutation 4.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 13
% Syntax : Number of formulae : 38 ( 14 unt; 9 typ; 0 def)
% Number of atoms : 54 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 45 ( 20 ~; 18 |; 3 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 12 ( 6 >; 6 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 28 (; 28 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ distinct_points > distinct_lines > convergent_lines > apart_point_and_line > line_connecting > intersection_point > #nlpp > #skF_2 > #skF_3 > #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_3',type,
'#skF_3': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(distinct_lines,type,
distinct_lines: ( $i * $i ) > $o ).
tff(f_59,axiom,
! [X] : ~ distinct_points(X,X),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO008+0.ax',apart1) ).
tff(f_141,negated_conjecture,
~ ! [X,Y,Z] :
( ( distinct_points(X,Y)
& apart_point_and_line(Z,line_connecting(X,Y)) )
=> ( distinct_lines(line_connecting(X,Y),line_connecting(Z,X))
& distinct_lines(line_connecting(X,Y),line_connecting(Z,Y)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
tff(f_92,axiom,
! [X,Y,Z] :
( distinct_points(X,Y)
=> ( apart_point_and_line(Z,line_connecting(X,Y))
=> ( distinct_points(Z,X)
& distinct_points(Z,Y) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO008+0.ax',con1) ).
tff(f_126,axiom,
! [X,Y,Z] :
( apart_point_and_line(X,Y)
=> ( distinct_lines(Y,Z)
| apart_point_and_line(X,Z) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO008+0.ax',ceq2) ).
tff(c_2,plain,
! [X_1] : ~ distinct_points(X_1,X_1),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_34,plain,
distinct_points('#skF_1','#skF_2'),
inference(cnfTransformation,[status(thm)],[f_141]) ).
tff(c_32,plain,
apart_point_and_line('#skF_3',line_connecting('#skF_1','#skF_2')),
inference(cnfTransformation,[status(thm)],[f_141]) ).
tff(c_783,plain,
! [Z_104,Y_105,X_106] :
( distinct_points(Z_104,Y_105)
| ~ apart_point_and_line(Z_104,line_connecting(X_106,Y_105))
| ~ distinct_points(X_106,Y_105) ),
inference(cnfTransformation,[status(thm)],[f_92]) ).
tff(c_795,plain,
( distinct_points('#skF_3','#skF_2')
| ~ distinct_points('#skF_1','#skF_2') ),
inference(resolution,[status(thm)],[c_32,c_783]) ).
tff(c_803,plain,
distinct_points('#skF_3','#skF_2'),
inference(demodulation,[status(thm),theory(equality)],[c_34,c_795]) ).
tff(c_553,plain,
! [X_83,Z_84,Y_85] :
( apart_point_and_line(X_83,Z_84)
| distinct_lines(Y_85,Z_84)
| ~ apart_point_and_line(X_83,Y_85) ),
inference(cnfTransformation,[status(thm)],[f_126]) ).
tff(c_557,plain,
! [Z_86] :
( apart_point_and_line('#skF_3',Z_86)
| distinct_lines(line_connecting('#skF_1','#skF_2'),Z_86) ),
inference(resolution,[status(thm)],[c_32,c_553]) ).
tff(c_500,plain,
! [Z_79,X_80,Y_81] :
( distinct_points(Z_79,X_80)
| ~ apart_point_and_line(Z_79,line_connecting(X_80,Y_81))
| ~ distinct_points(X_80,Y_81) ),
inference(cnfTransformation,[status(thm)],[f_92]) ).
tff(c_515,plain,
( distinct_points('#skF_3','#skF_1')
| ~ distinct_points('#skF_1','#skF_2') ),
inference(resolution,[status(thm)],[c_32,c_500]) ).
tff(c_528,plain,
distinct_points('#skF_3','#skF_1'),
inference(demodulation,[status(thm),theory(equality)],[c_34,c_515]) ).
tff(c_68,plain,
! [X_46,Z_47,Y_48] :
( apart_point_and_line(X_46,Z_47)
| distinct_lines(Y_48,Z_47)
| ~ apart_point_and_line(X_46,Y_48) ),
inference(cnfTransformation,[status(thm)],[f_126]) ).
tff(c_72,plain,
! [Z_49] :
( apart_point_and_line('#skF_3',Z_49)
| distinct_lines(line_connecting('#skF_1','#skF_2'),Z_49) ),
inference(resolution,[status(thm)],[c_32,c_68]) ).
tff(c_30,plain,
( ~ distinct_lines(line_connecting('#skF_1','#skF_2'),line_connecting('#skF_3','#skF_2'))
| ~ distinct_lines(line_connecting('#skF_1','#skF_2'),line_connecting('#skF_3','#skF_1')) ),
inference(cnfTransformation,[status(thm)],[f_141]) ).
tff(c_53,plain,
~ distinct_lines(line_connecting('#skF_1','#skF_2'),line_connecting('#skF_3','#skF_1')),
inference(splitLeft,[status(thm)],[c_30]) ).
tff(c_82,plain,
apart_point_and_line('#skF_3',line_connecting('#skF_3','#skF_1')),
inference(resolution,[status(thm)],[c_72,c_53]) ).
tff(c_512,plain,
( distinct_points('#skF_3','#skF_3')
| ~ distinct_points('#skF_3','#skF_1') ),
inference(resolution,[status(thm)],[c_82,c_500]) ).
tff(c_525,plain,
~ distinct_points('#skF_3','#skF_1'),
inference(negUnitSimplification,[status(thm)],[c_2,c_512]) ).
tff(c_533,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_528,c_525]) ).
tff(c_534,plain,
~ distinct_lines(line_connecting('#skF_1','#skF_2'),line_connecting('#skF_3','#skF_2')),
inference(splitRight,[status(thm)],[c_30]) ).
tff(c_567,plain,
apart_point_and_line('#skF_3',line_connecting('#skF_3','#skF_2')),
inference(resolution,[status(thm)],[c_557,c_534]) ).
tff(c_1210,plain,
! [Z_129,X_130,Y_131] :
( distinct_points(Z_129,X_130)
| ~ apart_point_and_line(Z_129,line_connecting(X_130,Y_131))
| ~ distinct_points(X_130,Y_131) ),
inference(cnfTransformation,[status(thm)],[f_92]) ).
tff(c_1219,plain,
( distinct_points('#skF_3','#skF_3')
| ~ distinct_points('#skF_3','#skF_2') ),
inference(resolution,[status(thm)],[c_567,c_1210]) ).
tff(c_1231,plain,
distinct_points('#skF_3','#skF_3'),
inference(demodulation,[status(thm),theory(equality)],[c_803,c_1219]) ).
tff(c_1233,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_2,c_1231]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GEO179+2 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.14 % 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.35 % Computer : n006.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 : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri Aug 4 00:21:43 EDT 2023
% 0.13/0.36 % CPUTime :
% 4.20/2.03 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.20/2.04
% 4.20/2.04 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.20/2.07
% 4.20/2.07 Inference rules
% 4.20/2.07 ----------------------
% 4.20/2.07 #Ref : 0
% 4.20/2.07 #Sup : 172
% 4.20/2.07 #Fact : 50
% 4.20/2.07 #Define : 0
% 4.20/2.07 #Split : 1
% 4.20/2.07 #Chain : 0
% 4.20/2.07 #Close : 0
% 4.20/2.07
% 4.20/2.07 Ordering : KBO
% 4.20/2.07
% 4.20/2.07 Simplification rules
% 4.20/2.07 ----------------------
% 4.20/2.07 #Subsume : 31
% 4.20/2.07 #Demod : 80
% 4.20/2.07 #Tautology : 69
% 4.20/2.07 #SimpNegUnit : 2
% 4.20/2.07 #BackRed : 0
% 4.20/2.07
% 4.20/2.07 #Partial instantiations: 0
% 4.20/2.07 #Strategies tried : 1
% 4.20/2.07
% 4.20/2.07 Timing (in seconds)
% 4.20/2.07 ----------------------
% 4.20/2.07 Preprocessing : 0.47
% 4.20/2.07 Parsing : 0.26
% 4.20/2.07 CNF conversion : 0.03
% 4.20/2.07 Main loop : 0.53
% 4.20/2.07 Inferencing : 0.22
% 4.20/2.07 Reduction : 0.13
% 4.20/2.07 Demodulation : 0.08
% 4.20/2.07 BG Simplification : 0.03
% 4.20/2.07 Subsumption : 0.12
% 4.20/2.07 Abstraction : 0.02
% 4.20/2.07 MUC search : 0.00
% 4.20/2.07 Cooper : 0.00
% 4.20/2.07 Total : 1.05
% 4.20/2.08 Index Insertion : 0.00
% 4.20/2.08 Index Deletion : 0.00
% 4.20/2.08 Index Matching : 0.00
% 4.20/2.08 BG Taut test : 0.00
%------------------------------------------------------------------------------