TSTP Solution File: GEO209+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO209+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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n011.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:41 EDT 2023
% Result : Theorem 3.38s 1.85s
% Output : CNFRefutation 3.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 14
% Syntax : Number of formulae : 29 ( 10 unt; 11 typ; 0 def)
% Number of atoms : 37 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 31 ( 12 ~; 12 |; 4 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 14 ( 7 >; 7 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 19 (; 19 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ distinct_points > distinct_lines > convergent_lines > apart_point_and_line > parallel_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(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('#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_191,negated_conjecture,
~ ! [A,L,M,N] :
( ( apart_point_and_line(A,L)
& ~ apart_point_and_line(A,M)
& ~ apart_point_and_line(A,N)
& ~ convergent_lines(M,L)
& ~ convergent_lines(N,L) )
=> ~ distinct_lines(M,N) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
tff(f_171,axiom,
! [X,Y,Z] :
( distinct_lines(Y,Z)
=> ( apart_point_and_line(X,Y)
| apart_point_and_line(X,Z)
| convergent_lines(Y,Z) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+2.ax',cup1) ).
tff(f_78,axiom,
! [X,Y,Z] :
( convergent_lines(X,Y)
=> ( convergent_lines(X,Z)
| convergent_lines(Y,Z) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ax6) ).
tff(c_42,plain,
~ apart_point_and_line('#skF_1','#skF_4'),
inference(cnfTransformation,[status(thm)],[f_191]) ).
tff(c_38,plain,
~ convergent_lines('#skF_4','#skF_2'),
inference(cnfTransformation,[status(thm)],[f_191]) ).
tff(c_36,plain,
distinct_lines('#skF_3','#skF_4'),
inference(cnfTransformation,[status(thm)],[f_191]) ).
tff(c_103,plain,
! [Y_77,Z_78,X_79] :
( convergent_lines(Y_77,Z_78)
| apart_point_and_line(X_79,Z_78)
| apart_point_and_line(X_79,Y_77)
| ~ distinct_lines(Y_77,Z_78) ),
inference(cnfTransformation,[status(thm)],[f_171]) ).
tff(c_115,plain,
! [X_79] :
( convergent_lines('#skF_3','#skF_4')
| apart_point_and_line(X_79,'#skF_4')
| apart_point_and_line(X_79,'#skF_3') ),
inference(resolution,[status(thm)],[c_36,c_103]) ).
tff(c_116,plain,
convergent_lines('#skF_3','#skF_4'),
inference(splitLeft,[status(thm)],[c_115]) ).
tff(c_12,plain,
! [Y_11,Z_12,X_10] :
( convergent_lines(Y_11,Z_12)
| convergent_lines(X_10,Z_12)
| ~ convergent_lines(X_10,Y_11) ),
inference(cnfTransformation,[status(thm)],[f_78]) ).
tff(c_123,plain,
! [Z_80] :
( convergent_lines('#skF_4',Z_80)
| convergent_lines('#skF_3',Z_80) ),
inference(resolution,[status(thm)],[c_116,c_12]) ).
tff(c_40,plain,
~ convergent_lines('#skF_3','#skF_2'),
inference(cnfTransformation,[status(thm)],[f_191]) ).
tff(c_134,plain,
convergent_lines('#skF_4','#skF_2'),
inference(resolution,[status(thm)],[c_123,c_40]) ).
tff(c_141,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_38,c_134]) ).
tff(c_144,plain,
! [X_81] :
( apart_point_and_line(X_81,'#skF_4')
| apart_point_and_line(X_81,'#skF_3') ),
inference(splitRight,[status(thm)],[c_115]) ).
tff(c_44,plain,
~ apart_point_and_line('#skF_1','#skF_3'),
inference(cnfTransformation,[status(thm)],[f_191]) ).
tff(c_159,plain,
apart_point_and_line('#skF_1','#skF_4'),
inference(resolution,[status(thm)],[c_144,c_44]) ).
tff(c_167,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_42,c_159]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : GEO209+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.15 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.15/0.37 % Computer : n011.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Fri Aug 4 00:49:36 EDT 2023
% 0.22/0.37 % CPUTime :
% 3.38/1.85 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.38/1.85
% 3.38/1.85 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.38/1.88
% 3.38/1.88 Inference rules
% 3.38/1.88 ----------------------
% 3.38/1.88 #Ref : 0
% 3.38/1.88 #Sup : 25
% 3.38/1.88 #Fact : 0
% 3.38/1.88 #Define : 0
% 3.38/1.88 #Split : 1
% 3.38/1.88 #Chain : 0
% 3.38/1.88 #Close : 0
% 3.38/1.88
% 3.38/1.88 Ordering : KBO
% 3.38/1.88
% 3.38/1.88 Simplification rules
% 3.38/1.88 ----------------------
% 3.38/1.88 #Subsume : 1
% 3.38/1.88 #Demod : 2
% 3.38/1.88 #Tautology : 2
% 3.38/1.88 #SimpNegUnit : 2
% 3.38/1.88 #BackRed : 0
% 3.38/1.88
% 3.38/1.88 #Partial instantiations: 0
% 3.38/1.88 #Strategies tried : 1
% 3.38/1.88
% 3.38/1.88 Timing (in seconds)
% 3.38/1.88 ----------------------
% 3.38/1.88 Preprocessing : 0.49
% 3.38/1.88 Parsing : 0.28
% 3.38/1.88 CNF conversion : 0.03
% 3.38/1.88 Main loop : 0.30
% 3.38/1.88 Inferencing : 0.12
% 3.38/1.88 Reduction : 0.07
% 3.38/1.88 Demodulation : 0.05
% 3.38/1.88 BG Simplification : 0.02
% 3.38/1.88 Subsumption : 0.07
% 3.38/1.88 Abstraction : 0.01
% 3.38/1.88 MUC search : 0.00
% 3.38/1.88 Cooper : 0.00
% 3.38/1.88 Total : 0.83
% 3.38/1.88 Index Insertion : 0.00
% 3.38/1.89 Index Deletion : 0.00
% 3.38/1.89 Index Matching : 0.00
% 3.38/1.89 BG Taut test : 0.00
%------------------------------------------------------------------------------