TSTP Solution File: GEO172+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO172+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 : n008.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:24 EDT 2023
% Result : Theorem 4.20s 1.99s
% Output : CNFRefutation 4.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 15
% Syntax : Number of formulae : 35 ( 10 unt; 9 typ; 0 def)
% Number of atoms : 65 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 59 ( 20 ~; 31 |; 3 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 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 : 34 (; 34 !; 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_60,axiom,
! [X] : ~ convergent_lines(X,X),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',apart3) ).
tff(f_145,negated_conjecture,
~ ! [X,Y,Z] :
( ( convergent_lines(X,Y)
& ~ apart_point_and_line(Z,X)
& ~ apart_point_and_line(Z,Y) )
=> ~ distinct_points(Z,intersection_point(X,Y)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
tff(f_131,axiom,
! [X,Y,Z] :
( convergent_lines(X,Y)
=> ( distinct_lines(Y,Z)
| convergent_lines(X,Z) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ceq3) ).
tff(f_112,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_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(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(c_6,plain,
! [X_3] : ~ convergent_lines(X_3,X_3),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_34,plain,
~ apart_point_and_line('#skF_3','#skF_1'),
inference(cnfTransformation,[status(thm)],[f_145]) ).
tff(c_36,plain,
convergent_lines('#skF_1','#skF_2'),
inference(cnfTransformation,[status(thm)],[f_145]) ).
tff(c_32,plain,
~ apart_point_and_line('#skF_3','#skF_2'),
inference(cnfTransformation,[status(thm)],[f_145]) ).
tff(c_30,plain,
distinct_points('#skF_3',intersection_point('#skF_1','#skF_2')),
inference(cnfTransformation,[status(thm)],[f_145]) ).
tff(c_60,plain,
! [X_55,Z_56,Y_57] :
( convergent_lines(X_55,Z_56)
| distinct_lines(Y_57,Z_56)
| ~ convergent_lines(X_55,Y_57) ),
inference(cnfTransformation,[status(thm)],[f_131]) ).
tff(c_66,plain,
! [Z_56] :
( convergent_lines('#skF_1',Z_56)
| distinct_lines('#skF_2',Z_56) ),
inference(resolution,[status(thm)],[c_36,c_60]) ).
tff(c_214,plain,
! [Y_74,V_75,U_76,X_77] :
( apart_point_and_line(Y_74,V_75)
| apart_point_and_line(Y_74,U_76)
| apart_point_and_line(X_77,V_75)
| apart_point_and_line(X_77,U_76)
| ~ distinct_lines(U_76,V_75)
| ~ distinct_points(X_77,Y_74) ),
inference(cnfTransformation,[status(thm)],[f_112]) ).
tff(c_487,plain,
! [Y_91,Z_92,X_93] :
( apart_point_and_line(Y_91,Z_92)
| apart_point_and_line(Y_91,'#skF_2')
| apart_point_and_line(X_93,Z_92)
| apart_point_and_line(X_93,'#skF_2')
| ~ distinct_points(X_93,Y_91)
| convergent_lines('#skF_1',Z_92) ),
inference(resolution,[status(thm)],[c_66,c_214]) ).
tff(c_499,plain,
! [Z_92] :
( apart_point_and_line(intersection_point('#skF_1','#skF_2'),Z_92)
| apart_point_and_line(intersection_point('#skF_1','#skF_2'),'#skF_2')
| apart_point_and_line('#skF_3',Z_92)
| apart_point_and_line('#skF_3','#skF_2')
| convergent_lines('#skF_1',Z_92) ),
inference(resolution,[status(thm)],[c_30,c_487]) ).
tff(c_509,plain,
! [Z_92] :
( apart_point_and_line(intersection_point('#skF_1','#skF_2'),Z_92)
| apart_point_and_line(intersection_point('#skF_1','#skF_2'),'#skF_2')
| apart_point_and_line('#skF_3',Z_92)
| convergent_lines('#skF_1',Z_92) ),
inference(negUnitSimplification,[status(thm)],[c_32,c_499]) ).
tff(c_595,plain,
apart_point_and_line(intersection_point('#skF_1','#skF_2'),'#skF_2'),
inference(splitLeft,[status(thm)],[c_509]) ).
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_608,plain,
~ convergent_lines('#skF_1','#skF_2'),
inference(resolution,[status(thm)],[c_595,c_20]) ).
tff(c_614,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_36,c_608]) ).
tff(c_624,plain,
! [Z_98] :
( apart_point_and_line(intersection_point('#skF_1','#skF_2'),Z_98)
| apart_point_and_line('#skF_3',Z_98)
| convergent_lines('#skF_1',Z_98) ),
inference(splitRight,[status(thm)],[c_509]) ).
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_635,plain,
( ~ convergent_lines('#skF_1','#skF_2')
| apart_point_and_line('#skF_3','#skF_1')
| convergent_lines('#skF_1','#skF_1') ),
inference(resolution,[status(thm)],[c_624,c_18]) ).
tff(c_655,plain,
( apart_point_and_line('#skF_3','#skF_1')
| convergent_lines('#skF_1','#skF_1') ),
inference(demodulation,[status(thm),theory(equality)],[c_36,c_635]) ).
tff(c_657,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_6,c_34,c_655]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GEO172+1 : 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.17/0.35 % Computer : n008.cluster.edu
% 0.17/0.35 % Model : x86_64 x86_64
% 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35 % Memory : 8042.1875MB
% 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35 % CPULimit : 300
% 0.17/0.35 % WCLimit : 300
% 0.17/0.35 % DateTime : Fri Aug 4 00:28:48 EDT 2023
% 0.17/0.35 % CPUTime :
% 4.20/1.99 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.20/2.00
% 4.20/2.00 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.20/2.02
% 4.20/2.02 Inference rules
% 4.20/2.02 ----------------------
% 4.20/2.02 #Ref : 0
% 4.20/2.02 #Sup : 113
% 4.20/2.02 #Fact : 18
% 4.20/2.02 #Define : 0
% 4.20/2.02 #Split : 2
% 4.20/2.03 #Chain : 0
% 4.20/2.03 #Close : 0
% 4.20/2.03
% 4.20/2.03 Ordering : KBO
% 4.20/2.03
% 4.20/2.03 Simplification rules
% 4.20/2.03 ----------------------
% 4.20/2.03 #Subsume : 17
% 4.20/2.03 #Demod : 27
% 4.20/2.03 #Tautology : 25
% 4.20/2.03 #SimpNegUnit : 4
% 4.20/2.03 #BackRed : 0
% 4.20/2.03
% 4.20/2.03 #Partial instantiations: 0
% 4.20/2.03 #Strategies tried : 1
% 4.20/2.03
% 4.20/2.03 Timing (in seconds)
% 4.20/2.03 ----------------------
% 4.39/2.03 Preprocessing : 0.49
% 4.39/2.03 Parsing : 0.29
% 4.39/2.03 CNF conversion : 0.03
% 4.39/2.03 Main loop : 0.46
% 4.39/2.03 Inferencing : 0.19
% 4.39/2.03 Reduction : 0.10
% 4.39/2.03 Demodulation : 0.06
% 4.39/2.03 BG Simplification : 0.02
% 4.39/2.03 Subsumption : 0.12
% 4.39/2.03 Abstraction : 0.02
% 4.39/2.03 MUC search : 0.00
% 4.39/2.03 Cooper : 0.00
% 4.39/2.03 Total : 1.01
% 4.39/2.03 Index Insertion : 0.00
% 4.39/2.03 Index Deletion : 0.00
% 4.39/2.03 Index Matching : 0.00
% 4.39/2.03 BG Taut test : 0.00
%------------------------------------------------------------------------------