TSTP Solution File: GEO261+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO261+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 : 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:55 EDT 2023
% Result : Theorem 3.71s 1.94s
% Output : CNFRefutation 3.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 32
% Syntax : Number of formulae : 43 ( 4 unt; 27 typ; 0 def)
% Number of atoms : 35 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 34 ( 15 ~; 11 |; 4 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 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 : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 31 (; 31 !; 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_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_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_290,negated_conjecture,
~ ! [L,M,A,B,C] :
( ( between_on_line(L,A,B,C)
& convergent_lines(L,M)
& incident_point_and_line(B,M) )
=> divides_points(M,A,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_229,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_148,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_242,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_229,c_148]) ).
tff(c_290,plain,
! [L_143,M_144] :
( ~ unequally_directed_lines(L_143,M_144)
| ~ convergent_lines(L_143,M_144) ),
inference(resolution,[status(thm)],[c_30,c_242]) ).
tff(c_305,plain,
! [L_13,M_14] : ~ convergent_lines(L_13,M_14),
inference(resolution,[status(thm)],[c_32,c_290]) ).
tff(c_138,plain,
convergent_lines('#skF_1','#skF_2'),
inference(cnfTransformation,[status(thm)],[f_290]) ).
tff(c_308,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_305,c_138]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GEO261+3 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.14 % 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.13/0.35 % Computer : n027.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri Aug 4 01:11:09 EDT 2023
% 0.13/0.35 % CPUTime :
% 3.71/1.94 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.71/1.94
% 3.71/1.94 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.99/1.97
% 3.99/1.97 Inference rules
% 3.99/1.97 ----------------------
% 3.99/1.97 #Ref : 0
% 3.99/1.97 #Sup : 28
% 3.99/1.97 #Fact : 0
% 3.99/1.97 #Define : 0
% 3.99/1.97 #Split : 1
% 3.99/1.97 #Chain : 0
% 3.99/1.97 #Close : 0
% 3.99/1.97
% 3.99/1.97 Ordering : KBO
% 3.99/1.97
% 3.99/1.97 Simplification rules
% 3.99/1.97 ----------------------
% 3.99/1.97 #Subsume : 36
% 3.99/1.97 #Demod : 0
% 3.99/1.97 #Tautology : 5
% 3.99/1.97 #SimpNegUnit : 17
% 3.99/1.97 #BackRed : 1
% 3.99/1.97
% 3.99/1.97 #Partial instantiations: 0
% 3.99/1.97 #Strategies tried : 1
% 3.99/1.97
% 3.99/1.97 Timing (in seconds)
% 3.99/1.97 ----------------------
% 3.99/1.97 Preprocessing : 0.58
% 3.99/1.97 Parsing : 0.32
% 3.99/1.97 CNF conversion : 0.05
% 3.99/1.97 Main loop : 0.33
% 3.99/1.97 Inferencing : 0.11
% 3.99/1.97 Reduction : 0.09
% 3.99/1.97 Demodulation : 0.06
% 3.99/1.97 BG Simplification : 0.03
% 3.99/1.97 Subsumption : 0.08
% 3.99/1.97 Abstraction : 0.01
% 3.99/1.97 MUC search : 0.00
% 3.99/1.97 Cooper : 0.00
% 3.99/1.97 Total : 0.96
% 3.99/1.97 Index Insertion : 0.00
% 3.99/1.97 Index Deletion : 0.00
% 3.99/1.97 Index Matching : 0.00
% 3.99/1.97 BG Taut test : 0.00
%------------------------------------------------------------------------------