TSTP Solution File: GEO174+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO174+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 : n010.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 4.37s 2.14s
% Output : CNFRefutation 4.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 24
% Syntax : Number of formulae : 41 ( 10 unt; 20 typ; 0 def)
% Number of atoms : 38 ( 0 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 29 ( 12 ~; 11 |; 2 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 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 : 23 (; 23 !; 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)
& ( apart_point_and_line(X,U)
| apart_point_and_line(Y,U) ) )
=> distinct_lines(U,line_connecting(X,Y)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
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/GEO006+0.ax',ceq2) ).
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_100,plain,
distinct_points('#skF_1','#skF_2'),
inference(cnfTransformation,[status(thm)],[f_439]) ).
tff(c_96,plain,
( apart_point_and_line('#skF_2','#skF_3')
| apart_point_and_line('#skF_1','#skF_3') ),
inference(cnfTransformation,[status(thm)],[f_439]) ).
tff(c_107,plain,
apart_point_and_line('#skF_1','#skF_3'),
inference(splitLeft,[status(thm)],[c_96]) ).
tff(c_488,plain,
! [X_198,Z_199,Y_200] :
( apart_point_and_line(X_198,Z_199)
| distinct_lines(Y_200,Z_199)
| ~ apart_point_and_line(X_198,Y_200) ),
inference(cnfTransformation,[status(thm)],[f_126]) ).
tff(c_492,plain,
! [Z_201] :
( apart_point_and_line('#skF_1',Z_201)
| distinct_lines('#skF_3',Z_201) ),
inference(resolution,[status(thm)],[c_107,c_488]) ).
tff(c_94,plain,
~ distinct_lines('#skF_3',line_connecting('#skF_1','#skF_2')),
inference(cnfTransformation,[status(thm)],[f_439]) ).
tff(c_507,plain,
apart_point_and_line('#skF_1',line_connecting('#skF_1','#skF_2')),
inference(resolution,[status(thm)],[c_492,c_94]) ).
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_516,plain,
~ distinct_points('#skF_1','#skF_2'),
inference(resolution,[status(thm)],[c_507,c_14]) ).
tff(c_522,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_100,c_516]) ).
tff(c_523,plain,
apart_point_and_line('#skF_2','#skF_3'),
inference(splitRight,[status(thm)],[c_96]) ).
tff(c_1071,plain,
! [X_322,Z_323,Y_324] :
( apart_point_and_line(X_322,Z_323)
| distinct_lines(Y_324,Z_323)
| ~ apart_point_and_line(X_322,Y_324) ),
inference(cnfTransformation,[status(thm)],[f_126]) ).
tff(c_1075,plain,
! [Z_325] :
( apart_point_and_line('#skF_2',Z_325)
| distinct_lines('#skF_3',Z_325) ),
inference(resolution,[status(thm)],[c_523,c_1071]) ).
tff(c_1090,plain,
apart_point_and_line('#skF_2',line_connecting('#skF_1','#skF_2')),
inference(resolution,[status(thm)],[c_1075,c_94]) ).
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_1099,plain,
~ distinct_points('#skF_1','#skF_2'),
inference(resolution,[status(thm)],[c_1090,c_16]) ).
tff(c_1105,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_100,c_1099]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GEO174+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.14/0.35 % Computer : n010.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri Aug 4 00:28:58 EDT 2023
% 0.14/0.35 % CPUTime :
% 4.37/2.14 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.88/2.14
% 4.88/2.14 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.88/2.17
% 4.88/2.17 Inference rules
% 4.88/2.17 ----------------------
% 4.88/2.17 #Ref : 0
% 4.88/2.17 #Sup : 208
% 4.88/2.17 #Fact : 6
% 4.88/2.17 #Define : 0
% 4.88/2.17 #Split : 1
% 4.88/2.17 #Chain : 0
% 4.88/2.17 #Close : 0
% 4.88/2.17
% 4.88/2.17 Ordering : KBO
% 4.88/2.17
% 4.88/2.17 Simplification rules
% 4.88/2.17 ----------------------
% 4.88/2.17 #Subsume : 23
% 4.88/2.17 #Demod : 38
% 4.88/2.17 #Tautology : 46
% 4.88/2.17 #SimpNegUnit : 1
% 4.88/2.17 #BackRed : 0
% 4.88/2.17
% 4.88/2.17 #Partial instantiations: 0
% 4.88/2.17 #Strategies tried : 1
% 4.88/2.17
% 4.88/2.17 Timing (in seconds)
% 4.88/2.17 ----------------------
% 4.88/2.17 Preprocessing : 0.57
% 4.88/2.17 Parsing : 0.32
% 4.88/2.17 CNF conversion : 0.04
% 4.88/2.17 Main loop : 0.56
% 4.88/2.17 Inferencing : 0.23
% 4.88/2.17 Reduction : 0.14
% 4.88/2.17 Demodulation : 0.09
% 4.88/2.17 BG Simplification : 0.03
% 4.88/2.17 Subsumption : 0.11
% 4.88/2.17 Abstraction : 0.02
% 4.88/2.17 MUC search : 0.00
% 4.88/2.17 Cooper : 0.00
% 4.88/2.17 Total : 1.17
% 4.88/2.17 Index Insertion : 0.00
% 4.88/2.17 Index Deletion : 0.00
% 4.88/2.17 Index Matching : 0.00
% 4.88/2.17 BG Taut test : 0.00
%------------------------------------------------------------------------------