TSTP Solution File: GEO262+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO262+1 : TPTP v8.1.2. Bugfixed v6.4.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 : n027.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:56 EDT 2023
% Result : Theorem 3.68s 1.88s
% Output : CNFRefutation 3.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 26
% Syntax : Number of formulae : 35 ( 4 unt; 22 typ; 0 def)
% Number of atoms : 32 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 33 ( 14 ~; 9 |; 7 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 33 ( 16 >; 17 *; 0 +; 0 <<)
% Number of predicates : 13 ( 12 usr; 1 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 26 (; 26 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ between_on_line > divides_points > before_on_line > unequally_directed_lines > left_convergent_lines > left_apart_point > distinct_points > distinct_lines > convergent_lines > apart_point_and_line > point > line > parallel_through_point > line_connecting > intersection_point > #nlpp > reverse_line > #skF_5 > #skF_6 > #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(point,type,
point: $i > $o ).
tff(reverse_line,type,
reverse_line: $i > $i ).
tff(line,type,
line: $i > $o ).
tff('#skF_5',type,
'#skF_5': $i ).
tff(between_on_line,type,
between_on_line: ( $i * $i * $i * $i ) > $o ).
tff('#skF_6',type,
'#skF_6': $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(left_convergent_lines,type,
left_convergent_lines: ( $i * $i ) > $o ).
tff(distinct_lines,type,
distinct_lines: ( $i * $i ) > $o ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(before_on_line,type,
before_on_line: ( $i * $i * $i ) > $o ).
tff(divides_points,type,
divides_points: ( $i * $i * $i ) > $o ).
tff(left_apart_point,type,
left_apart_point: ( $i * $i ) > $o ).
tff(unequally_directed_lines,type,
unequally_directed_lines: ( $i * $i ) > $o ).
tff(f_63,axiom,
! [L,M] :
( convergent_lines(L,M)
<=> ( unequally_directed_lines(L,M)
& unequally_directed_lines(L,reverse_line(M)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',con_def) ).
tff(f_166,axiom,
! [L,M] :
~ ( left_convergent_lines(L,M)
| left_convergent_lines(L,reverse_line(M)) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oag11) ).
tff(f_156,axiom,
! [L,M] :
( ( unequally_directed_lines(L,M)
& unequally_directed_lines(L,reverse_line(M)) )
=> ( left_convergent_lines(L,M)
| left_convergent_lines(L,reverse_line(M)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oag9) ).
tff(f_294,negated_conjecture,
~ ! [L,M,N,A,B,C] :
( ( between_on_line(L,A,B,C)
& convergent_lines(L,M)
& ~ apart_point_and_line(B,M)
& convergent_lines(L,N)
& convergent_lines(M,N)
& ~ apart_point_and_line(B,N) )
=> between_on_line(M,intersection_point(M,parallel_through_point(N,A)),B,intersection_point(M,parallel_through_point(N,C))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
tff(c_12,plain,
! [L_3,M_4] :
( unequally_directed_lines(L_3,M_4)
| ~ convergent_lines(L_3,M_4) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_10,plain,
! [L_3,M_4] :
( unequally_directed_lines(L_3,reverse_line(M_4))
| ~ convergent_lines(L_3,M_4) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_80,plain,
! [L_36,M_37] : ~ left_convergent_lines(L_36,M_37),
inference(cnfTransformation,[status(thm)],[f_166]) ).
tff(c_74,plain,
! [L_32,M_33] :
( left_convergent_lines(L_32,reverse_line(M_33))
| left_convergent_lines(L_32,M_33)
| ~ unequally_directed_lines(L_32,reverse_line(M_33))
| ~ unequally_directed_lines(L_32,M_33) ),
inference(cnfTransformation,[status(thm)],[f_156]) ).
tff(c_185,plain,
! [L_103,M_104] :
( ~ unequally_directed_lines(L_103,reverse_line(M_104))
| ~ unequally_directed_lines(L_103,M_104) ),
inference(negUnitSimplification,[status(thm)],[c_80,c_80,c_74]) ).
tff(c_196,plain,
! [L_107,M_108] :
( ~ unequally_directed_lines(L_107,M_108)
| ~ convergent_lines(L_107,M_108) ),
inference(resolution,[status(thm)],[c_10,c_185]) ).
tff(c_204,plain,
! [L_3,M_4] : ~ convergent_lines(L_3,M_4),
inference(resolution,[status(thm)],[c_12,c_196]) ).
tff(c_122,plain,
convergent_lines('#skF_2','#skF_3'),
inference(cnfTransformation,[status(thm)],[f_294]) ).
tff(c_208,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_204,c_122]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GEO262+1 : TPTP v8.1.2. Bugfixed v6.4.0.
% 0.00/0.14 % 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.35 % Computer : n027.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri Aug 4 01:02:54 EDT 2023
% 0.15/0.35 % CPUTime :
% 3.68/1.88 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.68/1.88
% 3.68/1.88 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.68/1.91
% 3.68/1.91 Inference rules
% 3.68/1.91 ----------------------
% 3.68/1.91 #Ref : 0
% 3.68/1.91 #Sup : 8
% 3.68/1.91 #Fact : 0
% 3.68/1.91 #Define : 0
% 3.68/1.91 #Split : 1
% 3.68/1.91 #Chain : 0
% 3.68/1.91 #Close : 0
% 3.68/1.91
% 3.68/1.91 Ordering : KBO
% 3.68/1.91
% 3.68/1.91 Simplification rules
% 3.68/1.91 ----------------------
% 3.68/1.91 #Subsume : 38
% 3.68/1.91 #Demod : 0
% 3.68/1.91 #Tautology : 0
% 3.68/1.91 #SimpNegUnit : 18
% 3.68/1.91 #BackRed : 3
% 3.68/1.91
% 3.68/1.91 #Partial instantiations: 0
% 3.68/1.91 #Strategies tried : 1
% 3.68/1.91
% 3.68/1.91 Timing (in seconds)
% 3.68/1.91 ----------------------
% 3.88/1.91 Preprocessing : 0.57
% 3.88/1.91 Parsing : 0.31
% 3.88/1.91 CNF conversion : 0.04
% 3.88/1.91 Main loop : 0.28
% 3.88/1.91 Inferencing : 0.08
% 3.88/1.91 Reduction : 0.08
% 3.88/1.91 Demodulation : 0.05
% 3.88/1.91 BG Simplification : 0.03
% 3.88/1.91 Subsumption : 0.08
% 3.88/1.91 Abstraction : 0.01
% 3.88/1.91 MUC search : 0.00
% 3.88/1.91 Cooper : 0.00
% 3.88/1.91 Total : 0.89
% 3.88/1.91 Index Insertion : 0.00
% 3.88/1.91 Index Deletion : 0.00
% 3.88/1.91 Index Matching : 0.00
% 3.88/1.91 BG Taut test : 0.00
%------------------------------------------------------------------------------