TSTP Solution File: GEO242+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO242+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/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 : n025.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:51 EDT 2023
% Result : Theorem 3.03s 1.75s
% Output : CNFRefutation 3.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 21
% Syntax : Number of formulae : 24 ( 3 unt; 19 typ; 0 def)
% Number of atoms : 9 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 8 ( 4 ~; 1 |; 2 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 7 (; 7 !; 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_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(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(between_on_line,type,
between_on_line: ( $i * $i * $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(left_convergent_lines,type,
left_convergent_lines: ( $i * $i ) > $o ).
tff(distinct_lines,type,
distinct_lines: ( $i * $i ) > $o ).
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_166,axiom,
! [L,M] :
~ ( left_convergent_lines(L,M)
| left_convergent_lines(L,reverse_line(M)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO007+0.ax',oag11) ).
tff(f_287,negated_conjecture,
~ ! [A,B,L] :
( ( ~ apart_point_and_line(A,L)
& distinct_points(A,B)
& left_convergent_lines(L,reverse_line(line_connecting(A,B))) )
=> left_apart_point(B,reverse_line(L)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
tff(c_82,plain,
! [L_36,M_37] : ~ left_convergent_lines(L_36,reverse_line(M_37)),
inference(cnfTransformation,[status(thm)],[f_166]) ).
tff(c_120,plain,
left_convergent_lines('#skF_3',reverse_line(line_connecting('#skF_1','#skF_2'))),
inference(cnfTransformation,[status(thm)],[f_287]) ).
tff(c_125,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_82,c_120]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GEO242+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/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.15/0.35 % Computer : n025.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.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri Aug 4 00:35:35 EDT 2023
% 0.15/0.36 % CPUTime :
% 3.03/1.75 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.03/1.75
% 3.03/1.75 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.32/1.78
% 3.32/1.78 Inference rules
% 3.32/1.78 ----------------------
% 3.32/1.78 #Ref : 0
% 3.32/1.78 #Sup : 0
% 3.32/1.78 #Fact : 0
% 3.32/1.78 #Define : 0
% 3.32/1.78 #Split : 0
% 3.32/1.78 #Chain : 0
% 3.32/1.78 #Close : 0
% 3.32/1.78
% 3.32/1.78 Ordering : KBO
% 3.32/1.78
% 3.32/1.78 Simplification rules
% 3.32/1.78 ----------------------
% 3.32/1.78 #Subsume : 61
% 3.32/1.78 #Demod : 0
% 3.32/1.78 #Tautology : 0
% 3.32/1.78 #SimpNegUnit : 1
% 3.32/1.78 #BackRed : 0
% 3.32/1.78
% 3.32/1.78 #Partial instantiations: 0
% 3.32/1.78 #Strategies tried : 1
% 3.32/1.78
% 3.32/1.78 Timing (in seconds)
% 3.32/1.78 ----------------------
% 3.32/1.79 Preprocessing : 0.59
% 3.32/1.79 Parsing : 0.32
% 3.32/1.79 CNF conversion : 0.04
% 3.32/1.79 Main loop : 0.10
% 3.32/1.79 Inferencing : 0.00
% 3.32/1.79 Reduction : 0.04
% 3.32/1.79 Demodulation : 0.03
% 3.32/1.79 BG Simplification : 0.03
% 3.32/1.79 Subsumption : 0.04
% 3.32/1.79 Abstraction : 0.01
% 3.32/1.79 MUC search : 0.00
% 3.32/1.79 Cooper : 0.00
% 3.32/1.79 Total : 0.74
% 3.32/1.79 Index Insertion : 0.00
% 3.32/1.79 Index Deletion : 0.00
% 3.32/1.79 Index Matching : 0.00
% 3.32/1.79 BG Taut test : 0.00
%------------------------------------------------------------------------------