TSTP Solution File: GEO215+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO215+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 : n031.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:43 EDT 2023
% Result : Theorem 6.42s 2.49s
% Output : CNFRefutation 6.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 19
% Syntax : Number of formulae : 40 ( 9 unt; 12 typ; 0 def)
% Number of atoms : 67 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 60 ( 21 ~; 33 |; 0 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 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 : 50 (; 50 !; 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_237,negated_conjecture,
~ ! [L,M,N] :
( convergent_lines(L,M)
=> ( unorthogonal_lines(L,N)
| unorthogonal_lines(M,N) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
tff(f_60,axiom,
! [X] : ~ distinct_lines(X,X),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO008+0.ax',apart2) ).
tff(f_128,axiom,
! [X,Y] :
( convergent_lines(X,Y)
=> distinct_lines(X,Y) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO008+0.ax',ceq3) ).
tff(f_75,axiom,
! [X,Y,Z] :
( distinct_lines(X,Y)
=> ( distinct_lines(X,Z)
| distinct_lines(Y,Z) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO008+0.ax',apart5) ).
tff(f_228,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_98,axiom,
! [X,Y,Z] :
( convergent_lines(X,Y)
=> ( ( apart_point_and_line(Z,X)
| apart_point_and_line(Z,Y) )
=> distinct_points(Z,intersection_point(X,Y)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO008+0.ax',con2) ).
tff(f_57,axiom,
! [X] : ~ distinct_points(X,X),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO008+0.ax',apart1) ).
tff(c_56,plain,
convergent_lines('#skF_1','#skF_2'),
inference(cnfTransformation,[status(thm)],[f_237]) ).
tff(c_4,plain,
! [X_2] : ~ distinct_lines(X_2,X_2),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_28,plain,
! [X_29,Y_30] :
( distinct_lines(X_29,Y_30)
| ~ convergent_lines(X_29,Y_30) ),
inference(cnfTransformation,[status(thm)],[f_128]) ).
tff(c_156,plain,
! [Y_91,Z_92,X_93] :
( distinct_lines(Y_91,Z_92)
| distinct_lines(X_93,Z_92)
| ~ distinct_lines(X_93,Y_91) ),
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_160,plain,
! [Y_94,Z_95,X_96] :
( distinct_lines(Y_94,Z_95)
| distinct_lines(X_96,Z_95)
| ~ convergent_lines(X_96,Y_94) ),
inference(resolution,[status(thm)],[c_28,c_156]) ).
tff(c_190,plain,
! [Z_95] :
( distinct_lines('#skF_2',Z_95)
| distinct_lines('#skF_1',Z_95) ),
inference(resolution,[status(thm)],[c_56,c_160]) ).
tff(c_2372,plain,
! [M_252,N_253,L_254,A_255] :
( unorthogonal_lines(M_252,N_253)
| unorthogonal_lines(L_254,N_253)
| apart_point_and_line(A_255,M_252)
| apart_point_and_line(A_255,L_254)
| ~ distinct_lines(L_254,M_252) ),
inference(cnfTransformation,[status(thm)],[f_228]) ).
tff(c_2680,plain,
! [Z_260,N_261,A_262] :
( unorthogonal_lines(Z_260,N_261)
| unorthogonal_lines('#skF_2',N_261)
| apart_point_and_line(A_262,Z_260)
| apart_point_and_line(A_262,'#skF_2')
| distinct_lines('#skF_1',Z_260) ),
inference(resolution,[status(thm)],[c_190,c_2372]) ).
tff(c_52,plain,
~ unorthogonal_lines('#skF_2','#skF_3'),
inference(cnfTransformation,[status(thm)],[f_237]) ).
tff(c_3334,plain,
! [Z_277,A_278] :
( unorthogonal_lines(Z_277,'#skF_3')
| apart_point_and_line(A_278,Z_277)
| apart_point_and_line(A_278,'#skF_2')
| distinct_lines('#skF_1',Z_277) ),
inference(resolution,[status(thm)],[c_2680,c_52]) ).
tff(c_54,plain,
~ unorthogonal_lines('#skF_1','#skF_3'),
inference(cnfTransformation,[status(thm)],[f_237]) ).
tff(c_3352,plain,
! [A_278] :
( apart_point_and_line(A_278,'#skF_1')
| apart_point_and_line(A_278,'#skF_2')
| distinct_lines('#skF_1','#skF_1') ),
inference(resolution,[status(thm)],[c_3334,c_54]) ).
tff(c_3428,plain,
! [A_279] :
( apart_point_and_line(A_279,'#skF_1')
| apart_point_and_line(A_279,'#skF_2') ),
inference(negUnitSimplification,[status(thm)],[c_4,c_3352]) ).
tff(c_527,plain,
! [Z_135,Y_136,X_137] :
( ~ apart_point_and_line(Z_135,Y_136)
| distinct_points(Z_135,intersection_point(X_137,Y_136))
| ~ convergent_lines(X_137,Y_136) ),
inference(cnfTransformation,[status(thm)],[f_98]) ).
tff(c_2,plain,
! [X_1] : ~ distinct_points(X_1,X_1),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_535,plain,
! [X_137,Y_136] :
( ~ apart_point_and_line(intersection_point(X_137,Y_136),Y_136)
| ~ convergent_lines(X_137,Y_136) ),
inference(resolution,[status(thm)],[c_527,c_2]) ).
tff(c_3445,plain,
! [X_280] :
( ~ convergent_lines(X_280,'#skF_2')
| apart_point_and_line(intersection_point(X_280,'#skF_2'),'#skF_1') ),
inference(resolution,[status(thm)],[c_3428,c_535]) ).
tff(c_354,plain,
! [Z_119,X_120,Y_121] :
( ~ apart_point_and_line(Z_119,X_120)
| distinct_points(Z_119,intersection_point(X_120,Y_121))
| ~ convergent_lines(X_120,Y_121) ),
inference(cnfTransformation,[status(thm)],[f_98]) ).
tff(c_362,plain,
! [X_120,Y_121] :
( ~ apart_point_and_line(intersection_point(X_120,Y_121),X_120)
| ~ convergent_lines(X_120,Y_121) ),
inference(resolution,[status(thm)],[c_354,c_2]) ).
tff(c_3449,plain,
~ convergent_lines('#skF_1','#skF_2'),
inference(resolution,[status(thm)],[c_3445,c_362]) ).
tff(c_3457,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_56,c_3449]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GEO215+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.13/0.35 % Computer : n031.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri Aug 4 01:07:30 EDT 2023
% 0.13/0.35 % CPUTime :
% 6.42/2.49 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.42/2.49
% 6.42/2.49 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 6.42/2.52
% 6.42/2.52 Inference rules
% 6.42/2.52 ----------------------
% 6.42/2.52 #Ref : 0
% 6.42/2.52 #Sup : 687
% 6.42/2.52 #Fact : 92
% 6.42/2.52 #Define : 0
% 6.42/2.52 #Split : 1
% 6.42/2.52 #Chain : 0
% 6.42/2.52 #Close : 0
% 6.42/2.52
% 6.42/2.52 Ordering : KBO
% 6.42/2.52
% 6.42/2.52 Simplification rules
% 6.42/2.52 ----------------------
% 6.42/2.52 #Subsume : 123
% 6.42/2.52 #Demod : 131
% 6.42/2.52 #Tautology : 135
% 6.42/2.52 #SimpNegUnit : 13
% 6.42/2.52 #BackRed : 0
% 6.42/2.52
% 6.42/2.52 #Partial instantiations: 0
% 6.42/2.52 #Strategies tried : 1
% 6.42/2.52
% 6.42/2.52 Timing (in seconds)
% 6.42/2.52 ----------------------
% 6.42/2.52 Preprocessing : 0.56
% 6.42/2.52 Parsing : 0.32
% 6.42/2.53 CNF conversion : 0.04
% 6.42/2.53 Main loop : 0.91
% 6.42/2.53 Inferencing : 0.37
% 6.42/2.53 Reduction : 0.23
% 6.42/2.53 Demodulation : 0.14
% 6.42/2.53 BG Simplification : 0.04
% 6.42/2.53 Subsumption : 0.22
% 6.42/2.53 Abstraction : 0.03
% 6.42/2.53 MUC search : 0.00
% 6.42/2.53 Cooper : 0.00
% 6.42/2.53 Total : 1.52
% 6.42/2.53 Index Insertion : 0.00
% 6.42/2.53 Index Deletion : 0.00
% 6.42/2.53 Index Matching : 0.00
% 6.42/2.53 BG Taut test : 0.00
%------------------------------------------------------------------------------