TSTP Solution File: GEO217+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO217+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 : n024.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:43 EDT 2023
% Result : Theorem 3.60s 1.97s
% Output : CNFRefutation 3.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of formulae : 26 ( 7 unt; 10 typ; 0 def)
% Number of atoms : 31 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 25 ( 10 ~; 12 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 21 (; 21 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ unorthogonal_lines > 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(unorthogonal_lines,type,
unorthogonal_lines: ( $i * $i ) > $o ).
tff(distinct_lines,type,
distinct_lines: ( $i * $i ) > $o ).
tff(f_203,negated_conjecture,
~ ! [L,M,N] :
( ( ~ convergent_lines(L,M)
& ~ convergent_lines(L,N) )
=> ~ convergent_lines(M,N) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
tff(f_77,axiom,
! [X,Y,Z] :
( convergent_lines(X,Y)
=> ( convergent_lines(X,Z)
| convergent_lines(Y,Z) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ax6) ).
tff(f_59,axiom,
! [X] : ~ convergent_lines(X,X),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',apart3) ).
tff(c_44,plain,
~ convergent_lines('#skF_1','#skF_3'),
inference(cnfTransformation,[status(thm)],[f_203]) ).
tff(c_42,plain,
convergent_lines('#skF_2','#skF_3'),
inference(cnfTransformation,[status(thm)],[f_203]) ).
tff(c_55,plain,
! [Y_55,Z_56,X_57] :
( convergent_lines(Y_55,Z_56)
| convergent_lines(X_57,Z_56)
| ~ convergent_lines(X_57,Y_55) ),
inference(cnfTransformation,[status(thm)],[f_77]) ).
tff(c_59,plain,
! [Z_58] :
( convergent_lines('#skF_3',Z_58)
| convergent_lines('#skF_2',Z_58) ),
inference(resolution,[status(thm)],[c_42,c_55]) ).
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_77]) ).
tff(c_216,plain,
! [Z_90,Z_91] :
( convergent_lines(Z_90,Z_91)
| convergent_lines('#skF_2',Z_91)
| convergent_lines('#skF_3',Z_90) ),
inference(resolution,[status(thm)],[c_59,c_12]) ).
tff(c_6,plain,
! [X_3] : ~ convergent_lines(X_3,X_3),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_258,plain,
! [Z_92] :
( convergent_lines(Z_92,'#skF_2')
| convergent_lines('#skF_3',Z_92) ),
inference(resolution,[status(thm)],[c_216,c_6]) ).
tff(c_515,plain,
! [Z_107,Z_108] :
( convergent_lines(Z_107,Z_108)
| convergent_lines('#skF_3',Z_108)
| convergent_lines(Z_107,'#skF_2') ),
inference(resolution,[status(thm)],[c_258,c_12]) ).
tff(c_590,plain,
! [Z_111] :
( convergent_lines(Z_111,'#skF_3')
| convergent_lines(Z_111,'#skF_2') ),
inference(resolution,[status(thm)],[c_515,c_6]) ).
tff(c_46,plain,
~ convergent_lines('#skF_1','#skF_2'),
inference(cnfTransformation,[status(thm)],[f_203]) ).
tff(c_603,plain,
convergent_lines('#skF_1','#skF_3'),
inference(resolution,[status(thm)],[c_590,c_46]) ).
tff(c_612,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_44,c_603]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : GEO217+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/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 : n024.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:19:15 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.60/1.97 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.60/1.98
% 3.60/1.98 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.81/2.01
% 3.81/2.01 Inference rules
% 3.81/2.01 ----------------------
% 3.81/2.01 #Ref : 0
% 3.81/2.01 #Sup : 98
% 3.81/2.01 #Fact : 20
% 3.81/2.01 #Define : 0
% 3.81/2.01 #Split : 0
% 3.81/2.01 #Chain : 0
% 3.81/2.01 #Close : 0
% 3.81/2.01
% 3.81/2.01 Ordering : KBO
% 3.81/2.01
% 3.81/2.01 Simplification rules
% 3.81/2.01 ----------------------
% 3.81/2.01 #Subsume : 18
% 3.81/2.01 #Demod : 26
% 3.81/2.01 #Tautology : 28
% 3.81/2.01 #SimpNegUnit : 1
% 3.81/2.01 #BackRed : 0
% 3.81/2.01
% 3.81/2.01 #Partial instantiations: 0
% 3.81/2.01 #Strategies tried : 1
% 3.81/2.01
% 3.81/2.01 Timing (in seconds)
% 3.81/2.01 ----------------------
% 3.81/2.01 Preprocessing : 0.49
% 3.81/2.01 Parsing : 0.28
% 3.81/2.01 CNF conversion : 0.03
% 3.81/2.01 Main loop : 0.42
% 3.81/2.01 Inferencing : 0.18
% 3.81/2.01 Reduction : 0.09
% 3.81/2.01 Demodulation : 0.06
% 3.81/2.01 BG Simplification : 0.02
% 3.81/2.01 Subsumption : 0.10
% 3.81/2.01 Abstraction : 0.02
% 3.81/2.01 MUC search : 0.00
% 3.81/2.01 Cooper : 0.00
% 3.81/2.01 Total : 0.96
% 3.81/2.01 Index Insertion : 0.00
% 3.81/2.01 Index Deletion : 0.00
% 3.81/2.01 Index Matching : 0.00
% 3.81/2.01 BG Taut test : 0.00
%------------------------------------------------------------------------------