TSTP Solution File: GEO233+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO233+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 : n013.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:48 EDT 2023
% Result : Theorem 3.64s 1.90s
% Output : CNFRefutation 3.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 22
% Syntax : Number of formulae : 34 ( 9 unt; 17 typ; 0 def)
% Number of atoms : 31 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 27 ( 13 ~; 11 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 21 (; 21 !; 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_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_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_281,negated_conjecture,
~ ! [L] : ~ unequally_directed_lines(reverse_line(reverse_line(L)),L),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
tff(f_128,axiom,
! [L,M,N] :
( unequally_directed_lines(L,M)
=> ( unequally_directed_lines(L,N)
| unequally_directed_lines(M,N) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO007+0.ax',oag6) ).
tff(f_122,axiom,
! [L] : ~ unequally_directed_lines(L,L),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO007+0.ax',oag5) ).
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_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/sandbox2/benchmark/Axioms/GEO007+0.ax',oag9) ).
tff(c_118,plain,
unequally_directed_lines(reverse_line(reverse_line('#skF_1')),'#skF_1'),
inference(cnfTransformation,[status(thm)],[f_281]) ).
tff(c_200,plain,
! [M_113,N_114,L_115] :
( unequally_directed_lines(M_113,N_114)
| unequally_directed_lines(L_115,N_114)
| ~ unequally_directed_lines(L_115,M_113) ),
inference(cnfTransformation,[status(thm)],[f_128]) ).
tff(c_204,plain,
! [N_116] :
( unequally_directed_lines('#skF_1',N_116)
| unequally_directed_lines(reverse_line(reverse_line('#skF_1')),N_116) ),
inference(resolution,[status(thm)],[c_118,c_200]) ).
tff(c_60,plain,
! [L_23] : ~ unequally_directed_lines(L_23,L_23),
inference(cnfTransformation,[status(thm)],[f_122]) ).
tff(c_217,plain,
unequally_directed_lines('#skF_1',reverse_line(reverse_line('#skF_1'))),
inference(resolution,[status(thm)],[c_204,c_60]) ).
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_126,plain,
! [L_32,M_33] :
( ~ unequally_directed_lines(L_32,reverse_line(M_33))
| ~ unequally_directed_lines(L_32,M_33) ),
inference(negUnitSimplification,[status(thm)],[c_80,c_80,c_74]) ).
tff(c_224,plain,
~ unequally_directed_lines('#skF_1',reverse_line('#skF_1')),
inference(resolution,[status(thm)],[c_217,c_126]) ).
tff(c_226,plain,
! [M_120] :
( ~ unequally_directed_lines(reverse_line(reverse_line('#skF_1')),M_120)
| unequally_directed_lines('#skF_1',reverse_line(M_120)) ),
inference(resolution,[status(thm)],[c_204,c_126]) ).
tff(c_232,plain,
unequally_directed_lines('#skF_1',reverse_line('#skF_1')),
inference(resolution,[status(thm)],[c_118,c_226]) ).
tff(c_237,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_224,c_232]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : GEO233+1 : TPTP v8.1.2. Bugfixed v6.4.0.
% 0.00/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 : n013.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:37:18 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.64/1.90 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.64/1.91
% 3.64/1.91 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.86/1.93
% 3.86/1.93 Inference rules
% 3.86/1.93 ----------------------
% 3.86/1.93 #Ref : 0
% 3.86/1.93 #Sup : 17
% 3.86/1.93 #Fact : 0
% 3.86/1.93 #Define : 0
% 3.86/1.93 #Split : 1
% 3.86/1.93 #Chain : 0
% 3.86/1.93 #Close : 0
% 3.86/1.93
% 3.86/1.93 Ordering : KBO
% 3.86/1.93
% 3.86/1.93 Simplification rules
% 3.86/1.93 ----------------------
% 3.86/1.93 #Subsume : 43
% 3.86/1.93 #Demod : 0
% 3.86/1.93 #Tautology : 0
% 3.86/1.93 #SimpNegUnit : 17
% 3.86/1.93 #BackRed : 0
% 3.86/1.93
% 3.86/1.93 #Partial instantiations: 0
% 3.86/1.93 #Strategies tried : 1
% 3.86/1.93
% 3.86/1.93 Timing (in seconds)
% 3.86/1.93 ----------------------
% 3.86/1.94 Preprocessing : 0.58
% 3.86/1.94 Parsing : 0.32
% 3.86/1.94 CNF conversion : 0.04
% 3.86/1.94 Main loop : 0.29
% 3.86/1.94 Inferencing : 0.10
% 3.86/1.94 Reduction : 0.07
% 3.86/1.94 Demodulation : 0.05
% 3.86/1.94 BG Simplification : 0.03
% 3.86/1.94 Subsumption : 0.08
% 3.86/1.94 Abstraction : 0.01
% 3.86/1.94 MUC search : 0.00
% 3.86/1.94 Cooper : 0.00
% 3.86/1.94 Total : 0.91
% 3.86/1.94 Index Insertion : 0.00
% 3.86/1.94 Index Deletion : 0.00
% 3.86/1.94 Index Matching : 0.00
% 3.86/1.94 BG Taut test : 0.00
%------------------------------------------------------------------------------