TSTP Solution File: GEO214+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO214+2 : 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 : n008.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:42 EDT 2023
% Result : Theorem 4.92s 2.14s
% Output : CNFRefutation 5.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 16
% Syntax : Number of formulae : 29 ( 8 unt; 11 typ; 0 def)
% Number of atoms : 37 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 27 ( 8 ~; 13 |; 3 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 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 : 6 ( 6 usr; 2 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_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_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_63,axiom,
! [X] : ~ convergent_lines(X,X),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO008+0.ax',apart3) ).
tff(f_197,axiom,
! [L,M] :
( convergent_lines(L,M)
| unorthogonal_lines(L,M) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+3.ax',occu1) ).
tff(f_235,negated_conjecture,
~ ! [L,M] :
( unorthogonal_lines(L,M)
=> unorthogonal_lines(M,L) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
tff(f_81,axiom,
! [X,Y,Z] :
( convergent_lines(X,Y)
=> ( convergent_lines(X,Z)
| convergent_lines(Y,Z) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO008+0.ax',apart6) ).
tff(f_210,axiom,
! [L,M,N] :
( ( convergent_lines(L,M)
& unorthogonal_lines(L,M) )
=> ( ( convergent_lines(L,N)
& unorthogonal_lines(L,N) )
| ( convergent_lines(M,N)
& unorthogonal_lines(M,N) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+3.ax',oac1) ).
tff(c_6,plain,
! [X_3] : ~ convergent_lines(X_3,X_3),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_68,plain,
! [L_64,M_65] :
( unorthogonal_lines(L_64,M_65)
| convergent_lines(L_64,M_65) ),
inference(cnfTransformation,[status(thm)],[f_197]) ).
tff(c_52,plain,
~ unorthogonal_lines('#skF_2','#skF_1'),
inference(cnfTransformation,[status(thm)],[f_235]) ).
tff(c_77,plain,
convergent_lines('#skF_2','#skF_1'),
inference(resolution,[status(thm)],[c_68,c_52]) ).
tff(c_83,plain,
! [Y_71,Z_72,X_73] :
( convergent_lines(Y_71,Z_72)
| convergent_lines(X_73,Z_72)
| ~ convergent_lines(X_73,Y_71) ),
inference(cnfTransformation,[status(thm)],[f_81]) ).
tff(c_91,plain,
! [Z_77] :
( convergent_lines('#skF_1',Z_77)
| convergent_lines('#skF_2',Z_77) ),
inference(resolution,[status(thm)],[c_77,c_83]) ).
tff(c_99,plain,
convergent_lines('#skF_1','#skF_2'),
inference(resolution,[status(thm)],[c_91,c_6]) ).
tff(c_54,plain,
unorthogonal_lines('#skF_1','#skF_2'),
inference(cnfTransformation,[status(thm)],[f_235]) ).
tff(c_1367,plain,
! [L_180,N_181,M_182] :
( convergent_lines(L_180,N_181)
| unorthogonal_lines(M_182,N_181)
| ~ unorthogonal_lines(L_180,M_182)
| ~ convergent_lines(L_180,M_182) ),
inference(cnfTransformation,[status(thm)],[f_210]) ).
tff(c_1371,plain,
! [N_181] :
( convergent_lines('#skF_1',N_181)
| unorthogonal_lines('#skF_2',N_181)
| ~ convergent_lines('#skF_1','#skF_2') ),
inference(resolution,[status(thm)],[c_54,c_1367]) ).
tff(c_1376,plain,
! [N_183] :
( convergent_lines('#skF_1',N_183)
| unorthogonal_lines('#skF_2',N_183) ),
inference(demodulation,[status(thm),theory(equality)],[c_99,c_1371]) ).
tff(c_1381,plain,
convergent_lines('#skF_1','#skF_1'),
inference(resolution,[status(thm)],[c_1376,c_52]) ).
tff(c_1386,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_6,c_1381]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GEO214+2 : TPTP v8.1.2. Released v3.3.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.14/0.35 % Computer : n008.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.20/0.35 % CPULimit : 300
% 0.20/0.35 % WCLimit : 300
% 0.20/0.35 % DateTime : Fri Aug 4 00:23:34 EDT 2023
% 0.20/0.35 % CPUTime :
% 4.92/2.14 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.92/2.14
% 4.92/2.14 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.07/2.17
% 5.07/2.17 Inference rules
% 5.07/2.17 ----------------------
% 5.07/2.17 #Ref : 0
% 5.07/2.17 #Sup : 192
% 5.07/2.17 #Fact : 60
% 5.07/2.17 #Define : 0
% 5.07/2.17 #Split : 0
% 5.07/2.17 #Chain : 0
% 5.07/2.17 #Close : 0
% 5.07/2.17
% 5.07/2.17 Ordering : KBO
% 5.07/2.17
% 5.07/2.17 Simplification rules
% 5.07/2.17 ----------------------
% 5.07/2.17 #Subsume : 59
% 5.07/2.17 #Demod : 62
% 5.07/2.17 #Tautology : 62
% 5.07/2.17 #SimpNegUnit : 21
% 5.07/2.17 #BackRed : 0
% 5.07/2.17
% 5.07/2.17 #Partial instantiations: 0
% 5.07/2.17 #Strategies tried : 1
% 5.07/2.17
% 5.07/2.17 Timing (in seconds)
% 5.07/2.17 ----------------------
% 5.07/2.17 Preprocessing : 0.51
% 5.07/2.17 Parsing : 0.29
% 5.07/2.17 CNF conversion : 0.03
% 5.07/2.17 Main loop : 0.59
% 5.07/2.17 Inferencing : 0.24
% 5.07/2.17 Reduction : 0.15
% 5.07/2.18 Demodulation : 0.09
% 5.07/2.18 BG Simplification : 0.03
% 5.07/2.18 Subsumption : 0.14
% 5.07/2.18 Abstraction : 0.02
% 5.07/2.18 MUC search : 0.00
% 5.07/2.18 Cooper : 0.00
% 5.07/2.18 Total : 1.14
% 5.07/2.18 Index Insertion : 0.00
% 5.07/2.18 Index Deletion : 0.00
% 5.07/2.18 Index Matching : 0.00
% 5.07/2.18 BG Taut test : 0.00
%------------------------------------------------------------------------------