TSTP Solution File: GEO262+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO262+3 : TPTP v8.1.2. Released v4.0.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 : n032.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.81s 1.98s
% Output : CNFRefutation 3.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 33
% Syntax : Number of formulae : 44 ( 4 unt; 28 typ; 0 def)
% Number of atoms : 38 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 37 ( 15 ~; 11 |; 7 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 45 ( 22 >; 23 *; 0 +; 0 <<)
% Number of predicates : 19 ( 18 usr; 1 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 32 (; 32 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ between_on_line > divides_points > before_on_line > unequally_directed_opposite_lines > unequally_directed_lines > right_convergent_lines > right_apart_point > left_convergent_lines > left_apart_point > incident_point_and_line > equally_directed_opposite_lines > equally_directed_lines > 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(incident_point_and_line,type,
incident_point_and_line: ( $i * $i ) > $o ).
tff(distinct_points,type,
distinct_points: ( $i * $i ) > $o ).
tff(unequally_directed_opposite_lines,type,
unequally_directed_opposite_lines: ( $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(equally_directed_opposite_lines,type,
equally_directed_opposite_lines: ( $i * $i ) > $o ).
tff(right_apart_point,type,
right_apart_point: ( $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(equally_directed_lines,type,
equally_directed_lines: ( $i * $i ) > $o ).
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(right_convergent_lines,type,
right_convergent_lines: ( $i * $i ) > $o ).
tff(f_83,axiom,
! [L,M] :
( convergent_lines(L,M)
<=> ( unequally_directed_lines(L,M)
& unequally_directed_opposite_lines(L,M) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',a7_defns) ).
tff(f_53,axiom,
! [X,Y] :
( unequally_directed_opposite_lines(X,Y)
<=> unequally_directed_lines(X,reverse_line(Y)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',a1_defns) ).
tff(f_173,axiom,
! [L,M] :
~ ( left_convergent_lines(L,M)
| left_convergent_lines(L,reverse_line(M)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',ax11_basics) ).
tff(f_163,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/sandbox2/benchmark/Axioms/GEO009+0.ax',ax9_basics) ).
tff(f_296,negated_conjecture,
~ ! [L,M,N,A,B,C] :
( ( between_on_line(L,A,B,C)
& convergent_lines(L,M)
& incident_point_and_line(B,M)
& convergent_lines(L,N)
& convergent_lines(M,N)
& incident_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/sandbox2/benchmark/theBenchmark.p',con) ).
tff(c_32,plain,
! [L_13,M_14] :
( unequally_directed_lines(L_13,M_14)
| ~ convergent_lines(L_13,M_14) ),
inference(cnfTransformation,[status(thm)],[f_83]) ).
tff(c_30,plain,
! [L_13,M_14] :
( unequally_directed_opposite_lines(L_13,M_14)
| ~ convergent_lines(L_13,M_14) ),
inference(cnfTransformation,[status(thm)],[f_83]) ).
tff(c_235,plain,
! [X_133,Y_134] :
( unequally_directed_lines(X_133,reverse_line(Y_134))
| ~ unequally_directed_opposite_lines(X_133,Y_134) ),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_96,plain,
! [L_46,M_47] : ~ left_convergent_lines(L_46,M_47),
inference(cnfTransformation,[status(thm)],[f_173]) ).
tff(c_90,plain,
! [L_42,M_43] :
( left_convergent_lines(L_42,reverse_line(M_43))
| left_convergent_lines(L_42,M_43)
| ~ unequally_directed_lines(L_42,reverse_line(M_43))
| ~ unequally_directed_lines(L_42,M_43) ),
inference(cnfTransformation,[status(thm)],[f_163]) ).
tff(c_154,plain,
! [L_42,M_43] :
( ~ unequally_directed_lines(L_42,reverse_line(M_43))
| ~ unequally_directed_lines(L_42,M_43) ),
inference(negUnitSimplification,[status(thm)],[c_96,c_96,c_90]) ).
tff(c_248,plain,
! [X_135,Y_136] :
( ~ unequally_directed_lines(X_135,Y_136)
| ~ unequally_directed_opposite_lines(X_135,Y_136) ),
inference(resolution,[status(thm)],[c_235,c_154]) ).
tff(c_270,plain,
! [L_139,M_140] :
( ~ unequally_directed_lines(L_139,M_140)
| ~ convergent_lines(L_139,M_140) ),
inference(resolution,[status(thm)],[c_30,c_248]) ).
tff(c_281,plain,
! [L_13,M_14] : ~ convergent_lines(L_13,M_14),
inference(resolution,[status(thm)],[c_32,c_270]) ).
tff(c_138,plain,
convergent_lines('#skF_2','#skF_3'),
inference(cnfTransformation,[status(thm)],[f_296]) ).
tff(c_307,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_281,c_138]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : GEO262+3 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.11 % 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.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 300
% 0.11/0.30 % DateTime : Fri Aug 4 00:32:51 EDT 2023
% 0.11/0.30 % CPUTime :
% 3.81/1.98 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.81/1.98
% 3.81/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 : 26
% 3.81/2.01 #Fact : 0
% 3.81/2.01 #Define : 0
% 3.81/2.01 #Split : 1
% 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 : 34
% 3.81/2.01 #Demod : 0
% 3.81/2.01 #Tautology : 4
% 3.81/2.01 #SimpNegUnit : 19
% 3.81/2.01 #BackRed : 3
% 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.60
% 3.81/2.01 Parsing : 0.33
% 3.81/2.01 CNF conversion : 0.04
% 3.81/2.01 Main loop : 0.32
% 3.81/2.01 Inferencing : 0.11
% 3.81/2.01 Reduction : 0.09
% 3.81/2.01 Demodulation : 0.06
% 3.81/2.01 BG Simplification : 0.03
% 3.81/2.01 Subsumption : 0.08
% 3.81/2.01 Abstraction : 0.01
% 3.81/2.01 MUC search : 0.00
% 3.81/2.01 Cooper : 0.00
% 3.81/2.01 Total : 0.97
% 3.81/2.01 Index Insertion : 0.00
% 3.81/2.02 Index Deletion : 0.00
% 3.81/2.02 Index Matching : 0.00
% 3.81/2.02 BG Taut test : 0.00
%------------------------------------------------------------------------------