TSTP Solution File: GEO173+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO173+3 : TPTP v8.1.2. Released v4.0.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 : n025.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:25 EDT 2023
% Result : Theorem 7.03s 2.66s
% Output : CNFRefutation 7.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 24
% Syntax : Number of formulae : 40 ( 10 unt; 20 typ; 0 def)
% Number of atoms : 46 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 40 ( 14 ~; 19 |; 3 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 30 ( 16 >; 14 *; 0 +; 0 <<)
% Number of predicates : 13 ( 12 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 22 (; 22 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ unorthogonal_lines > parallel_lines > orthogonal_lines > incident_point_and_line > equal_points > equal_lines > distinct_points > distinct_lines > convergent_lines > apart_point_and_line > point > line > parallel_through_point > orthogonal_through_point > line_connecting > intersection_point > #nlpp > #skF_2 > #skF_3 > #skF_1 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(line_connecting,type,
line_connecting: ( $i * $i ) > $i ).
tff(equal_lines,type,
equal_lines: ( $i * $i ) > $o ).
tff(equal_points,type,
equal_points: ( $i * $i ) > $o ).
tff(incident_point_and_line,type,
incident_point_and_line: ( $i * $i ) > $o ).
tff(distinct_points,type,
distinct_points: ( $i * $i ) > $o ).
tff(intersection_point,type,
intersection_point: ( $i * $i ) > $i ).
tff(parallel_through_point,type,
parallel_through_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(orthogonal_through_point,type,
orthogonal_through_point: ( $i * $i ) > $i ).
tff(point,type,
point: $i > $o ).
tff(line,type,
line: $i > $o ).
tff(parallel_lines,type,
parallel_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(unorthogonal_lines,type,
unorthogonal_lines: ( $i * $i ) > $o ).
tff(distinct_lines,type,
distinct_lines: ( $i * $i ) > $o ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(orthogonal_lines,type,
orthogonal_lines: ( $i * $i ) > $o ).
tff(f_439,negated_conjecture,
~ ! [X,Y,U,V] :
( ( distinct_points(X,Y)
& convergent_lines(U,V)
& distinct_lines(U,line_connecting(X,Y)) )
=> ( apart_point_and_line(X,U)
| apart_point_and_line(Y,U) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
tff(f_113,axiom,
! [X,Y,U,V] :
( ( distinct_points(X,Y)
& distinct_lines(U,V) )
=> ( apart_point_and_line(X,U)
| apart_point_and_line(X,V)
| apart_point_and_line(Y,U)
| apart_point_and_line(Y,V) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',cu1) ).
tff(f_85,axiom,
! [X,Y] :
( distinct_points(X,Y)
=> ~ apart_point_and_line(X,line_connecting(X,Y)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ci1) ).
tff(f_90,axiom,
! [X,Y] :
( distinct_points(X,Y)
=> ~ apart_point_and_line(Y,line_connecting(X,Y)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ci2) ).
tff(c_102,plain,
distinct_points('#skF_1','#skF_2'),
inference(cnfTransformation,[status(thm)],[f_439]) ).
tff(c_96,plain,
~ apart_point_and_line('#skF_1','#skF_3'),
inference(cnfTransformation,[status(thm)],[f_439]) ).
tff(c_94,plain,
~ apart_point_and_line('#skF_2','#skF_3'),
inference(cnfTransformation,[status(thm)],[f_439]) ).
tff(c_98,plain,
distinct_lines('#skF_3',line_connecting('#skF_1','#skF_2')),
inference(cnfTransformation,[status(thm)],[f_439]) ).
tff(c_3328,plain,
! [Y_371,V_372,U_373,X_374] :
( apart_point_and_line(Y_371,V_372)
| apart_point_and_line(Y_371,U_373)
| apart_point_and_line(X_374,V_372)
| apart_point_and_line(X_374,U_373)
| ~ distinct_lines(U_373,V_372)
| ~ distinct_points(X_374,Y_371) ),
inference(cnfTransformation,[status(thm)],[f_113]) ).
tff(c_3444,plain,
! [Y_378,X_379] :
( apart_point_and_line(Y_378,line_connecting('#skF_1','#skF_2'))
| apart_point_and_line(Y_378,'#skF_3')
| apart_point_and_line(X_379,line_connecting('#skF_1','#skF_2'))
| apart_point_and_line(X_379,'#skF_3')
| ~ distinct_points(X_379,Y_378) ),
inference(resolution,[status(thm)],[c_98,c_3328]) ).
tff(c_3468,plain,
( apart_point_and_line('#skF_2',line_connecting('#skF_1','#skF_2'))
| apart_point_and_line('#skF_2','#skF_3')
| apart_point_and_line('#skF_1',line_connecting('#skF_1','#skF_2'))
| apart_point_and_line('#skF_1','#skF_3') ),
inference(resolution,[status(thm)],[c_102,c_3444]) ).
tff(c_3500,plain,
( apart_point_and_line('#skF_2',line_connecting('#skF_1','#skF_2'))
| apart_point_and_line('#skF_1',line_connecting('#skF_1','#skF_2')) ),
inference(negUnitSimplification,[status(thm)],[c_96,c_94,c_3468]) ).
tff(c_3736,plain,
apart_point_and_line('#skF_1',line_connecting('#skF_1','#skF_2')),
inference(splitLeft,[status(thm)],[c_3500]) ).
tff(c_14,plain,
! [X_13,Y_14] :
( ~ apart_point_and_line(X_13,line_connecting(X_13,Y_14))
| ~ distinct_points(X_13,Y_14) ),
inference(cnfTransformation,[status(thm)],[f_85]) ).
tff(c_3743,plain,
~ distinct_points('#skF_1','#skF_2'),
inference(resolution,[status(thm)],[c_3736,c_14]) ).
tff(c_3749,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_102,c_3743]) ).
tff(c_3750,plain,
apart_point_and_line('#skF_2',line_connecting('#skF_1','#skF_2')),
inference(splitRight,[status(thm)],[c_3500]) ).
tff(c_16,plain,
! [Y_16,X_15] :
( ~ apart_point_and_line(Y_16,line_connecting(X_15,Y_16))
| ~ distinct_points(X_15,Y_16) ),
inference(cnfTransformation,[status(thm)],[f_90]) ).
tff(c_3758,plain,
~ distinct_points('#skF_1','#skF_2'),
inference(resolution,[status(thm)],[c_3750,c_16]) ).
tff(c_3764,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_102,c_3758]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GEO173+3 : TPTP v8.1.2. Released v4.0.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.15/0.36 % Computer : n025.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri Aug 4 00:50:20 EDT 2023
% 0.22/0.36 % CPUTime :
% 7.03/2.66 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.03/2.66
% 7.03/2.66 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 7.03/2.69
% 7.03/2.69 Inference rules
% 7.03/2.69 ----------------------
% 7.03/2.69 #Ref : 0
% 7.03/2.69 #Sup : 863
% 7.03/2.69 #Fact : 48
% 7.03/2.69 #Define : 0
% 7.03/2.69 #Split : 3
% 7.03/2.69 #Chain : 0
% 7.03/2.69 #Close : 0
% 7.03/2.69
% 7.03/2.69 Ordering : KBO
% 7.03/2.69
% 7.03/2.69 Simplification rules
% 7.03/2.69 ----------------------
% 7.03/2.69 #Subsume : 79
% 7.03/2.69 #Demod : 99
% 7.03/2.69 #Tautology : 93
% 7.03/2.69 #SimpNegUnit : 15
% 7.03/2.69 #BackRed : 0
% 7.03/2.69
% 7.03/2.69 #Partial instantiations: 0
% 7.03/2.69 #Strategies tried : 1
% 7.03/2.69
% 7.03/2.69 Timing (in seconds)
% 7.03/2.69 ----------------------
% 7.29/2.69 Preprocessing : 0.56
% 7.29/2.69 Parsing : 0.31
% 7.29/2.69 CNF conversion : 0.04
% 7.29/2.69 Main loop : 1.06
% 7.29/2.69 Inferencing : 0.38
% 7.29/2.69 Reduction : 0.28
% 7.29/2.69 Demodulation : 0.18
% 7.29/2.69 BG Simplification : 0.05
% 7.29/2.69 Subsumption : 0.28
% 7.29/2.69 Abstraction : 0.03
% 7.29/2.69 MUC search : 0.00
% 7.29/2.69 Cooper : 0.00
% 7.29/2.69 Total : 1.67
% 7.29/2.69 Index Insertion : 0.00
% 7.29/2.69 Index Deletion : 0.00
% 7.29/2.69 Index Matching : 0.00
% 7.29/2.70 BG Taut test : 0.00
%------------------------------------------------------------------------------