TSTP Solution File: GEO186+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO186+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 : n003.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:31 EDT 2023
% Result : Theorem 4.94s 2.31s
% Output : CNFRefutation 4.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 16
% Syntax : Number of formulae : 36 ( 10 unt; 10 typ; 0 def)
% Number of atoms : 66 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 60 ( 20 ~; 31 |; 4 &)
% ( 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 : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 35 (; 35 !; 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_60,axiom,
! [X] : ~ convergent_lines(X,X),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',apart3) ).
tff(f_147,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_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_1','#skF_3'),
inference(cnfTransformation,[status(thm)],[f_147]) ).
tff(c_36,plain,
convergent_lines('#skF_3','#skF_4'),
inference(cnfTransformation,[status(thm)],[f_147]) ).
tff(c_32,plain,
~ apart_point_and_line('#skF_1','#skF_4'),
inference(cnfTransformation,[status(thm)],[f_147]) ).
tff(c_30,plain,
distinct_points('#skF_1',intersection_point('#skF_3','#skF_4')),
inference(cnfTransformation,[status(thm)],[f_147]) ).
tff(c_65,plain,
! [X_58,Z_59,Y_60] :
( convergent_lines(X_58,Z_59)
| distinct_lines(Y_60,Z_59)
| ~ convergent_lines(X_58,Y_60) ),
inference(cnfTransformation,[status(thm)],[f_131]) ).
tff(c_74,plain,
! [Z_59] :
( convergent_lines('#skF_3',Z_59)
| distinct_lines('#skF_4',Z_59) ),
inference(resolution,[status(thm)],[c_36,c_65]) ).
tff(c_162,plain,
! [Y_70,V_71,U_72,X_73] :
( apart_point_and_line(Y_70,V_71)
| apart_point_and_line(Y_70,U_72)
| apart_point_and_line(X_73,V_71)
| apart_point_and_line(X_73,U_72)
| ~ distinct_lines(U_72,V_71)
| ~ distinct_points(X_73,Y_70) ),
inference(cnfTransformation,[status(thm)],[f_112]) ).
tff(c_505,plain,
! [Y_92,Z_93,X_94] :
( apart_point_and_line(Y_92,Z_93)
| apart_point_and_line(Y_92,'#skF_4')
| apart_point_and_line(X_94,Z_93)
| apart_point_and_line(X_94,'#skF_4')
| ~ distinct_points(X_94,Y_92)
| convergent_lines('#skF_3',Z_93) ),
inference(resolution,[status(thm)],[c_74,c_162]) ).
tff(c_539,plain,
! [Z_93] :
( apart_point_and_line(intersection_point('#skF_3','#skF_4'),Z_93)
| apart_point_and_line(intersection_point('#skF_3','#skF_4'),'#skF_4')
| apart_point_and_line('#skF_1',Z_93)
| apart_point_and_line('#skF_1','#skF_4')
| convergent_lines('#skF_3',Z_93) ),
inference(resolution,[status(thm)],[c_30,c_505]) ).
tff(c_570,plain,
! [Z_93] :
( apart_point_and_line(intersection_point('#skF_3','#skF_4'),Z_93)
| apart_point_and_line(intersection_point('#skF_3','#skF_4'),'#skF_4')
| apart_point_and_line('#skF_1',Z_93)
| convergent_lines('#skF_3',Z_93) ),
inference(negUnitSimplification,[status(thm)],[c_32,c_539]) ).
tff(c_1451,plain,
apart_point_and_line(intersection_point('#skF_3','#skF_4'),'#skF_4'),
inference(splitLeft,[status(thm)],[c_570]) ).
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_1458,plain,
~ convergent_lines('#skF_3','#skF_4'),
inference(resolution,[status(thm)],[c_1451,c_20]) ).
tff(c_1464,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_36,c_1458]) ).
tff(c_1609,plain,
! [Z_137] :
( apart_point_and_line(intersection_point('#skF_3','#skF_4'),Z_137)
| apart_point_and_line('#skF_1',Z_137)
| convergent_lines('#skF_3',Z_137) ),
inference(splitRight,[status(thm)],[c_570]) ).
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_1624,plain,
( ~ convergent_lines('#skF_3','#skF_4')
| apart_point_and_line('#skF_1','#skF_3')
| convergent_lines('#skF_3','#skF_3') ),
inference(resolution,[status(thm)],[c_1609,c_18]) ).
tff(c_1641,plain,
( apart_point_and_line('#skF_1','#skF_3')
| convergent_lines('#skF_3','#skF_3') ),
inference(demodulation,[status(thm),theory(equality)],[c_36,c_1624]) ).
tff(c_1643,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_6,c_34,c_1641]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : GEO186+1 : TPTP v8.1.2. Released v3.3.0.
% 0.13/0.15 % 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.36 % Computer : n003.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri Aug 4 00:16:24 EDT 2023
% 0.21/0.36 % CPUTime :
% 4.94/2.31 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.94/2.31
% 4.94/2.31 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.94/2.35
% 4.94/2.35 Inference rules
% 4.94/2.35 ----------------------
% 4.94/2.35 #Ref : 0
% 4.94/2.35 #Sup : 255
% 4.94/2.35 #Fact : 68
% 4.94/2.35 #Define : 0
% 4.94/2.35 #Split : 3
% 4.94/2.35 #Chain : 0
% 4.94/2.35 #Close : 0
% 4.94/2.35
% 4.94/2.35 Ordering : KBO
% 4.94/2.35
% 4.94/2.35 Simplification rules
% 4.94/2.35 ----------------------
% 4.94/2.35 #Subsume : 60
% 4.94/2.35 #Demod : 81
% 4.94/2.35 #Tautology : 79
% 4.94/2.35 #SimpNegUnit : 21
% 4.94/2.35 #BackRed : 0
% 4.94/2.35
% 4.94/2.35 #Partial instantiations: 0
% 4.94/2.35 #Strategies tried : 1
% 4.94/2.35
% 4.94/2.35 Timing (in seconds)
% 4.94/2.35 ----------------------
% 4.94/2.35 Preprocessing : 0.50
% 4.94/2.35 Parsing : 0.28
% 4.94/2.35 CNF conversion : 0.03
% 4.94/2.35 Main loop : 0.68
% 4.94/2.35 Inferencing : 0.26
% 4.94/2.35 Reduction : 0.15
% 4.94/2.35 Demodulation : 0.09
% 4.94/2.35 BG Simplification : 0.03
% 4.94/2.35 Subsumption : 0.20
% 4.94/2.35 Abstraction : 0.02
% 4.94/2.35 MUC search : 0.00
% 4.94/2.35 Cooper : 0.00
% 4.94/2.35 Total : 1.23
% 4.94/2.35 Index Insertion : 0.00
% 4.94/2.35 Index Deletion : 0.00
% 4.94/2.35 Index Matching : 0.00
% 4.94/2.35 BG Taut test : 0.00
%------------------------------------------------------------------------------