TSTP Solution File: GEO176+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO176+1 : 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 : 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:26 EDT 2023
% Result : Theorem 3.22s 1.82s
% Output : CNFRefutation 3.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 14
% Syntax : Number of formulae : 31 ( 10 unt; 10 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 : 12 ( 6 >; 6 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 23 (; 23 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ distinct_points > distinct_lines > convergent_lines > apart_point_and_line > 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(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('#skF_4',type,
'#skF_4': $i ).
tff(f_144,negated_conjecture,
~ ! [X,Y,U,V] :
( ( distinct_points(X,Y)
& convergent_lines(U,V)
& ( apart_point_and_line(X,U)
| apart_point_and_line(X,V) ) )
=> distinct_points(X,intersection_point(U,V)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
tff(f_119,axiom,
! [X,Y,Z] :
( apart_point_and_line(X,Y)
=> ( distinct_points(X,Z)
| apart_point_and_line(Z,Y) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ceq1) ).
tff(f_94,axiom,
! [X,Y] :
( convergent_lines(X,Y)
=> ~ apart_point_and_line(intersection_point(X,Y),X) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ci3) ).
tff(f_99,axiom,
! [X,Y] :
( convergent_lines(X,Y)
=> ~ apart_point_and_line(intersection_point(X,Y),Y) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ci4) ).
tff(c_34,plain,
convergent_lines('#skF_3','#skF_4'),
inference(cnfTransformation,[status(thm)],[f_144]) ).
tff(c_32,plain,
( apart_point_and_line('#skF_1','#skF_4')
| apart_point_and_line('#skF_1','#skF_3') ),
inference(cnfTransformation,[status(thm)],[f_144]) ).
tff(c_40,plain,
apart_point_and_line('#skF_1','#skF_3'),
inference(splitLeft,[status(thm)],[c_32]) ).
tff(c_144,plain,
! [Z_60,Y_61,X_62] :
( apart_point_and_line(Z_60,Y_61)
| distinct_points(X_62,Z_60)
| ~ apart_point_and_line(X_62,Y_61) ),
inference(cnfTransformation,[status(thm)],[f_119]) ).
tff(c_148,plain,
! [Z_63] :
( apart_point_and_line(Z_63,'#skF_3')
| distinct_points('#skF_1',Z_63) ),
inference(resolution,[status(thm)],[c_40,c_144]) ).
tff(c_30,plain,
~ distinct_points('#skF_1',intersection_point('#skF_3','#skF_4')),
inference(cnfTransformation,[status(thm)],[f_144]) ).
tff(c_159,plain,
apart_point_and_line(intersection_point('#skF_3','#skF_4'),'#skF_3'),
inference(resolution,[status(thm)],[c_148,c_30]) ).
tff(c_18,plain,
! [X_17,Y_18] :
( ~ apart_point_and_line(intersection_point(X_17,Y_18),X_17)
| ~ convergent_lines(X_17,Y_18) ),
inference(cnfTransformation,[status(thm)],[f_94]) ).
tff(c_168,plain,
~ convergent_lines('#skF_3','#skF_4'),
inference(resolution,[status(thm)],[c_159,c_18]) ).
tff(c_174,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_34,c_168]) ).
tff(c_175,plain,
apart_point_and_line('#skF_1','#skF_4'),
inference(splitRight,[status(thm)],[c_32]) ).
tff(c_192,plain,
! [Z_76,Y_77,X_78] :
( apart_point_and_line(Z_76,Y_77)
| distinct_points(X_78,Z_76)
| ~ apart_point_and_line(X_78,Y_77) ),
inference(cnfTransformation,[status(thm)],[f_119]) ).
tff(c_196,plain,
! [Z_79] :
( apart_point_and_line(Z_79,'#skF_4')
| distinct_points('#skF_1',Z_79) ),
inference(resolution,[status(thm)],[c_175,c_192]) ).
tff(c_204,plain,
apart_point_and_line(intersection_point('#skF_3','#skF_4'),'#skF_4'),
inference(resolution,[status(thm)],[c_196,c_30]) ).
tff(c_20,plain,
! [X_19,Y_20] :
( ~ apart_point_and_line(intersection_point(X_19,Y_20),Y_20)
| ~ convergent_lines(X_19,Y_20) ),
inference(cnfTransformation,[status(thm)],[f_99]) ).
tff(c_213,plain,
~ convergent_lines('#skF_3','#skF_4'),
inference(resolution,[status(thm)],[c_204,c_20]) ).
tff(c_219,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_34,c_213]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO176+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/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.35 % Computer : n025.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:50:50 EDT 2023
% 0.13/0.35 % CPUTime :
% 3.22/1.82 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.22/1.83
% 3.22/1.83 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.22/1.86
% 3.22/1.86 Inference rules
% 3.22/1.86 ----------------------
% 3.22/1.86 #Ref : 0
% 3.22/1.86 #Sup : 32
% 3.22/1.86 #Fact : 2
% 3.22/1.86 #Define : 0
% 3.22/1.86 #Split : 1
% 3.22/1.86 #Chain : 0
% 3.22/1.86 #Close : 0
% 3.22/1.86
% 3.22/1.86 Ordering : KBO
% 3.22/1.86
% 3.22/1.86 Simplification rules
% 3.22/1.86 ----------------------
% 3.22/1.86 #Subsume : 2
% 3.22/1.86 #Demod : 10
% 3.22/1.86 #Tautology : 8
% 3.22/1.86 #SimpNegUnit : 0
% 3.22/1.86 #BackRed : 0
% 3.22/1.86
% 3.22/1.86 #Partial instantiations: 0
% 3.22/1.86 #Strategies tried : 1
% 3.22/1.86
% 3.22/1.86 Timing (in seconds)
% 3.22/1.86 ----------------------
% 3.22/1.86 Preprocessing : 0.47
% 3.22/1.86 Parsing : 0.26
% 3.22/1.86 CNF conversion : 0.03
% 3.22/1.86 Main loop : 0.31
% 3.22/1.86 Inferencing : 0.13
% 3.22/1.86 Reduction : 0.07
% 3.22/1.86 Demodulation : 0.05
% 3.22/1.86 BG Simplification : 0.02
% 3.22/1.86 Subsumption : 0.07
% 3.22/1.86 Abstraction : 0.01
% 3.22/1.86 MUC search : 0.00
% 3.22/1.86 Cooper : 0.00
% 3.22/1.86 Total : 0.83
% 3.22/1.86 Index Insertion : 0.00
% 3.22/1.86 Index Deletion : 0.00
% 3.22/1.86 Index Matching : 0.00
% 3.22/1.86 BG Taut test : 0.00
%------------------------------------------------------------------------------