TSTP Solution File: GEO238+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO238+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/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 : n018.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:50 EDT 2023
% Result : Theorem 3.90s 1.86s
% Output : CNFRefutation 3.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 29
% Syntax : Number of formulae : 34 ( 4 unt; 26 typ; 0 def)
% Number of atoms : 17 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 15 ( 6 ~; 4 |; 3 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 17 (; 17 !; 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_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(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_168,axiom,
! [A,L] :
~ ( left_apart_point(A,L)
| left_apart_point(A,reverse_line(L)) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO009+0.ax',ax10_basics) ).
tff(f_93,axiom,
! [A,B,L] :
( divides_points(L,A,B)
<=> ( ( left_apart_point(A,L)
& right_apart_point(B,L) )
| ( right_apart_point(A,L)
& left_apart_point(B,L) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO009+0.ax',a8_defns) ).
tff(f_289,negated_conjecture,
~ ! [A,B,C,L] :
( ( divides_points(L,A,B)
& divides_points(L,A,C) )
=> ~ divides_points(L,B,C) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
tff(c_92,plain,
! [A_44,L_45] : ~ left_apart_point(A_44,L_45),
inference(cnfTransformation,[status(thm)],[f_168]) ).
tff(c_36,plain,
! [A_15,L_17,B_16] :
( left_apart_point(A_15,L_17)
| left_apart_point(B_16,L_17)
| ~ divides_points(L_17,A_15,B_16) ),
inference(cnfTransformation,[status(thm)],[f_93]) ).
tff(c_148,plain,
! [L_17,A_15,B_16] : ~ divides_points(L_17,A_15,B_16),
inference(negUnitSimplification,[status(thm)],[c_92,c_92,c_36]) ).
tff(c_134,plain,
divides_points('#skF_4','#skF_2','#skF_3'),
inference(cnfTransformation,[status(thm)],[f_289]) ).
tff(c_149,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_148,c_134]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : GEO238+3 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.15 % 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.37 % Computer : n018.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.22/0.37 % DateTime : Fri Aug 4 00:30:51 EDT 2023
% 0.22/0.37 % CPUTime :
% 3.90/1.86 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.90/1.86
% 3.90/1.86 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.99/1.89
% 3.99/1.89 Inference rules
% 3.99/1.89 ----------------------
% 3.99/1.89 #Ref : 0
% 3.99/1.89 #Sup : 0
% 3.99/1.89 #Fact : 0
% 3.99/1.89 #Define : 0
% 3.99/1.90 #Split : 0
% 3.99/1.90 #Chain : 0
% 3.99/1.90 #Close : 0
% 3.99/1.90
% 3.99/1.90 Ordering : KBO
% 3.99/1.90
% 3.99/1.90 Simplification rules
% 3.99/1.90 ----------------------
% 3.99/1.90 #Subsume : 68
% 3.99/1.90 #Demod : 0
% 3.99/1.90 #Tautology : 0
% 3.99/1.90 #SimpNegUnit : 13
% 3.99/1.90 #BackRed : 0
% 3.99/1.90
% 3.99/1.90 #Partial instantiations: 0
% 3.99/1.90 #Strategies tried : 1
% 3.99/1.90
% 3.99/1.90 Timing (in seconds)
% 3.99/1.90 ----------------------
% 3.99/1.90 Preprocessing : 0.59
% 3.99/1.90 Parsing : 0.32
% 3.99/1.90 CNF conversion : 0.05
% 3.99/1.90 Main loop : 0.15
% 3.99/1.90 Inferencing : 0.00
% 3.99/1.90 Reduction : 0.07
% 3.99/1.90 Demodulation : 0.04
% 3.99/1.90 BG Simplification : 0.03
% 3.99/1.90 Subsumption : 0.07
% 3.99/1.90 Abstraction : 0.01
% 3.99/1.90 MUC search : 0.00
% 3.99/1.90 Cooper : 0.00
% 3.99/1.90 Total : 0.80
% 3.99/1.90 Index Insertion : 0.00
% 3.99/1.90 Index Deletion : 0.00
% 3.99/1.90 Index Matching : 0.00
% 3.99/1.90 BG Taut test : 0.00
%------------------------------------------------------------------------------