TSTP Solution File: GEO232+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO232+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 : n003.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 4.16s 1.99s
% Output : CNFRefutation 4.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 20
% Syntax : Number of formulae : 27 ( 6 unt; 17 typ; 0 def)
% Number of atoms : 18 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 15 ( 7 ~; 5 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 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 : 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_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_122,axiom,
! [L] : ~ unequally_directed_lines(L,L),
file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oag5) ).
tff(f_282,negated_conjecture,
~ ! [L] :
( line(L)
=> unequally_directed_lines(L,reverse_line(L)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
tff(f_148,axiom,
! [L,M] :
( ( line(L)
& line(M) )
=> ( unequally_directed_lines(L,M)
| unequally_directed_lines(L,reverse_line(M)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oag8) ).
tff(c_60,plain,
! [L_23] : ~ unequally_directed_lines(L_23,L_23),
inference(cnfTransformation,[status(thm)],[f_122]) ).
tff(c_120,plain,
line('#skF_1'),
inference(cnfTransformation,[status(thm)],[f_282]) ).
tff(c_207,plain,
! [L_117,M_118] :
( unequally_directed_lines(L_117,reverse_line(M_118))
| unequally_directed_lines(L_117,M_118)
| ~ line(M_118)
| ~ line(L_117) ),
inference(cnfTransformation,[status(thm)],[f_148]) ).
tff(c_118,plain,
~ unequally_directed_lines('#skF_1',reverse_line('#skF_1')),
inference(cnfTransformation,[status(thm)],[f_282]) ).
tff(c_222,plain,
( unequally_directed_lines('#skF_1','#skF_1')
| ~ line('#skF_1') ),
inference(resolution,[status(thm)],[c_207,c_118]) ).
tff(c_233,plain,
unequally_directed_lines('#skF_1','#skF_1'),
inference(demodulation,[status(thm),theory(equality)],[c_120,c_222]) ).
tff(c_235,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_60,c_233]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : GEO232+1 : TPTP v8.1.2. Bugfixed v6.4.0.
% 0.13/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.14/0.36 % Computer : n003.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:44:23 EDT 2023
% 0.14/0.36 % CPUTime :
% 4.16/1.99 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.16/1.99
% 4.16/1.99 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.16/2.02
% 4.16/2.02 Inference rules
% 4.16/2.02 ----------------------
% 4.16/2.02 #Ref : 0
% 4.16/2.02 #Sup : 16
% 4.16/2.02 #Fact : 0
% 4.16/2.02 #Define : 0
% 4.16/2.02 #Split : 1
% 4.16/2.02 #Chain : 0
% 4.16/2.02 #Close : 0
% 4.16/2.02
% 4.16/2.02 Ordering : KBO
% 4.16/2.02
% 4.16/2.02 Simplification rules
% 4.16/2.02 ----------------------
% 4.16/2.02 #Subsume : 43
% 4.16/2.02 #Demod : 1
% 4.16/2.02 #Tautology : 1
% 4.16/2.02 #SimpNegUnit : 17
% 4.16/2.02 #BackRed : 0
% 4.16/2.02
% 4.16/2.02 #Partial instantiations: 0
% 4.16/2.02 #Strategies tried : 1
% 4.16/2.02
% 4.16/2.02 Timing (in seconds)
% 4.16/2.02 ----------------------
% 4.16/2.02 Preprocessing : 0.64
% 4.16/2.02 Parsing : 0.35
% 4.16/2.02 CNF conversion : 0.05
% 4.16/2.02 Main loop : 0.30
% 4.16/2.02 Inferencing : 0.10
% 4.16/2.02 Reduction : 0.08
% 4.16/2.02 Demodulation : 0.05
% 4.16/2.02 BG Simplification : 0.03
% 4.16/2.02 Subsumption : 0.09
% 4.16/2.02 Abstraction : 0.01
% 4.16/2.02 MUC search : 0.00
% 4.16/2.02 Cooper : 0.00
% 4.16/2.02 Total : 0.99
% 4.16/2.02 Index Insertion : 0.00
% 4.16/2.02 Index Deletion : 0.00
% 4.16/2.02 Index Matching : 0.00
% 4.16/2.02 BG Taut test : 0.00
%------------------------------------------------------------------------------