TSTP Solution File: GEO210+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO210+1 : TPTP v8.1.2. Released v3.3.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 : n009.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:41 EDT 2023
% Result : Theorem 5.49s 2.32s
% Output : CNFRefutation 5.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 16
% Syntax : Number of formulae : 29 ( 11 unt; 12 typ; 0 def)
% Number of atoms : 32 ( 0 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 26 ( 11 ~; 12 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 18 ( 9 >; 9 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 23 (; 23 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ unorthogonal_lines > distinct_points > distinct_lines > convergent_lines > apart_point_and_line > parallel_through_point > orthogonal_through_point > line_connecting > intersection_point > #nlpp > #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(orthogonal_through_point,type,
orthogonal_through_point: ( $i * $i ) > $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(unorthogonal_lines,type,
unorthogonal_lines: ( $i * $i ) > $o ).
tff(distinct_lines,type,
distinct_lines: ( $i * $i ) > $o ).
tff(f_243,negated_conjecture,
~ ! [A,L,M] :
( ( ~ apart_point_and_line(A,L)
& ~ unorthogonal_lines(L,M) )
=> ~ distinct_lines(L,orthogonal_through_point(M,A)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
tff(f_231,axiom,
! [A,L,M,N] :
( distinct_lines(L,M)
=> ( apart_point_and_line(A,L)
| apart_point_and_line(A,M)
| unorthogonal_lines(L,N)
| unorthogonal_lines(M,N) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+3.ax',ouo1) ).
tff(f_220,axiom,
! [A,L] : ~ apart_point_and_line(A,orthogonal_through_point(L,A)),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+3.ax',ooc2) ).
tff(f_217,axiom,
! [A,L] : ~ unorthogonal_lines(orthogonal_through_point(L,A),L),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+3.ax',ooc1) ).
tff(c_54,plain,
~ unorthogonal_lines('#skF_2','#skF_3'),
inference(cnfTransformation,[status(thm)],[f_243]) ).
tff(c_56,plain,
~ apart_point_and_line('#skF_1','#skF_2'),
inference(cnfTransformation,[status(thm)],[f_243]) ).
tff(c_52,plain,
distinct_lines('#skF_2',orthogonal_through_point('#skF_3','#skF_1')),
inference(cnfTransformation,[status(thm)],[f_243]) ).
tff(c_1656,plain,
! [M_211,N_212,L_213,A_214] :
( unorthogonal_lines(M_211,N_212)
| unorthogonal_lines(L_213,N_212)
| apart_point_and_line(A_214,M_211)
| apart_point_and_line(A_214,L_213)
| ~ distinct_lines(L_213,M_211) ),
inference(cnfTransformation,[status(thm)],[f_231]) ).
tff(c_1791,plain,
! [N_212,A_214] :
( unorthogonal_lines(orthogonal_through_point('#skF_3','#skF_1'),N_212)
| unorthogonal_lines('#skF_2',N_212)
| apart_point_and_line(A_214,orthogonal_through_point('#skF_3','#skF_1'))
| apart_point_and_line(A_214,'#skF_2') ),
inference(resolution,[status(thm)],[c_52,c_1656]) ).
tff(c_1885,plain,
! [A_221] :
( apart_point_and_line(A_221,orthogonal_through_point('#skF_3','#skF_1'))
| apart_point_and_line(A_221,'#skF_2') ),
inference(splitLeft,[status(thm)],[c_1791]) ).
tff(c_48,plain,
! [A_48,L_49] : ~ apart_point_and_line(A_48,orthogonal_through_point(L_49,A_48)),
inference(cnfTransformation,[status(thm)],[f_220]) ).
tff(c_1901,plain,
apart_point_and_line('#skF_1','#skF_2'),
inference(resolution,[status(thm)],[c_1885,c_48]) ).
tff(c_1909,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_56,c_1901]) ).
tff(c_1911,plain,
! [N_222] :
( unorthogonal_lines(orthogonal_through_point('#skF_3','#skF_1'),N_222)
| unorthogonal_lines('#skF_2',N_222) ),
inference(splitRight,[status(thm)],[c_1791]) ).
tff(c_46,plain,
! [L_47,A_46] : ~ unorthogonal_lines(orthogonal_through_point(L_47,A_46),L_47),
inference(cnfTransformation,[status(thm)],[f_217]) ).
tff(c_1923,plain,
unorthogonal_lines('#skF_2','#skF_3'),
inference(resolution,[status(thm)],[c_1911,c_46]) ).
tff(c_1931,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_54,c_1923]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO210+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13 % 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.33 % Computer : n009.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Fri Aug 4 00:28:08 EDT 2023
% 0.14/0.34 % CPUTime :
% 5.49/2.32 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.71/2.33
% 5.71/2.33 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.81/2.35
% 5.81/2.35 Inference rules
% 5.81/2.35 ----------------------
% 5.81/2.35 #Ref : 0
% 5.81/2.35 #Sup : 353
% 5.81/2.35 #Fact : 56
% 5.81/2.35 #Define : 0
% 5.81/2.35 #Split : 4
% 5.81/2.35 #Chain : 0
% 5.81/2.35 #Close : 0
% 5.81/2.35
% 5.81/2.35 Ordering : KBO
% 5.81/2.35
% 5.81/2.35 Simplification rules
% 5.81/2.35 ----------------------
% 5.81/2.35 #Subsume : 69
% 5.81/2.35 #Demod : 71
% 5.81/2.35 #Tautology : 75
% 5.81/2.35 #SimpNegUnit : 16
% 5.81/2.35 #BackRed : 0
% 5.81/2.35
% 5.81/2.35 #Partial instantiations: 0
% 5.81/2.35 #Strategies tried : 1
% 5.81/2.35
% 5.81/2.35 Timing (in seconds)
% 5.81/2.35 ----------------------
% 5.81/2.36 Preprocessing : 0.52
% 5.81/2.36 Parsing : 0.29
% 5.81/2.36 CNF conversion : 0.04
% 5.81/2.36 Main loop : 0.80
% 5.81/2.36 Inferencing : 0.29
% 5.81/2.36 Reduction : 0.19
% 5.81/2.36 Demodulation : 0.12
% 5.81/2.36 BG Simplification : 0.03
% 5.81/2.36 Subsumption : 0.24
% 5.81/2.36 Abstraction : 0.03
% 5.81/2.36 MUC search : 0.00
% 5.81/2.36 Cooper : 0.00
% 5.81/2.36 Total : 1.37
% 5.81/2.36 Index Insertion : 0.00
% 5.81/2.36 Index Deletion : 0.00
% 5.81/2.36 Index Matching : 0.00
% 5.81/2.36 BG Taut test : 0.00
%------------------------------------------------------------------------------