TSTP Solution File: GEO219+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO219+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:44 EDT 2023
% Result : Theorem 3.77s 1.90s
% Output : CNFRefutation 3.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 14
% Syntax : Number of formulae : 32 ( 10 unt; 10 typ; 0 def)
% Number of atoms : 47 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 48 ( 23 ~; 19 |; 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 : 14 ( 7 >; 7 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 26 (; 26 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ unorthogonal_lines > distinct_points > distinct_lines > convergent_lines > apart_point_and_line > 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(apart_point_and_line,type,
apart_point_and_line: ( $i * $i ) > $o ).
tff(convergent_lines,type,
convergent_lines: ( $i * $i ) > $o ).
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_203,negated_conjecture,
~ ! [L,M,N] :
( ( ~ unorthogonal_lines(L,M)
& ~ convergent_lines(L,N) )
=> ~ unorthogonal_lines(M,N) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
tff(f_162,axiom,
! [L,M] :
~ ( ~ convergent_lines(L,M)
& ~ unorthogonal_lines(L,M) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+4.ax',coipo1) ).
tff(f_77,axiom,
! [X,Y,Z] :
( convergent_lines(X,Y)
=> ( convergent_lines(X,Z)
| convergent_lines(Y,Z) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ax6) ).
tff(f_181,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+4.ax',cotno1) ).
tff(c_44,plain,
~ convergent_lines('#skF_1','#skF_3'),
inference(cnfTransformation,[status(thm)],[f_203]) ).
tff(c_50,plain,
! [L_45,M_46] :
( unorthogonal_lines(L_45,M_46)
| convergent_lines(L_45,M_46) ),
inference(cnfTransformation,[status(thm)],[f_162]) ).
tff(c_46,plain,
~ unorthogonal_lines('#skF_1','#skF_2'),
inference(cnfTransformation,[status(thm)],[f_203]) ).
tff(c_54,plain,
convergent_lines('#skF_1','#skF_2'),
inference(resolution,[status(thm)],[c_50,c_46]) ).
tff(c_59,plain,
! [Y_55,Z_56,X_57] :
( convergent_lines(Y_55,Z_56)
| convergent_lines(X_57,Z_56)
| ~ convergent_lines(X_57,Y_55) ),
inference(cnfTransformation,[status(thm)],[f_77]) ).
tff(c_62,plain,
! [Z_56] :
( convergent_lines('#skF_2',Z_56)
| convergent_lines('#skF_1',Z_56) ),
inference(resolution,[status(thm)],[c_54,c_59]) ).
tff(c_42,plain,
unorthogonal_lines('#skF_2','#skF_3'),
inference(cnfTransformation,[status(thm)],[f_203]) ).
tff(c_194,plain,
! [L_82,M_83,N_84] :
( convergent_lines(L_82,M_83)
| convergent_lines(L_82,N_84)
| ~ unorthogonal_lines(M_83,N_84)
| ~ convergent_lines(M_83,N_84) ),
inference(cnfTransformation,[status(thm)],[f_181]) ).
tff(c_206,plain,
! [L_82] :
( convergent_lines(L_82,'#skF_2')
| convergent_lines(L_82,'#skF_3')
| ~ convergent_lines('#skF_2','#skF_3') ),
inference(resolution,[status(thm)],[c_42,c_194]) ).
tff(c_207,plain,
~ convergent_lines('#skF_2','#skF_3'),
inference(splitLeft,[status(thm)],[c_206]) ).
tff(c_214,plain,
convergent_lines('#skF_1','#skF_3'),
inference(resolution,[status(thm)],[c_62,c_207]) ).
tff(c_219,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_44,c_214]) ).
tff(c_221,plain,
convergent_lines('#skF_2','#skF_3'),
inference(splitRight,[status(thm)],[c_206]) ).
tff(c_404,plain,
! [L_98,M_99,N_100] :
( unorthogonal_lines(L_98,M_99)
| convergent_lines(L_98,N_100)
| ~ unorthogonal_lines(M_99,N_100)
| ~ convergent_lines(M_99,N_100) ),
inference(cnfTransformation,[status(thm)],[f_181]) ).
tff(c_418,plain,
! [L_98] :
( unorthogonal_lines(L_98,'#skF_2')
| convergent_lines(L_98,'#skF_3')
| ~ convergent_lines('#skF_2','#skF_3') ),
inference(resolution,[status(thm)],[c_42,c_404]) ).
tff(c_431,plain,
! [L_101] :
( unorthogonal_lines(L_101,'#skF_2')
| convergent_lines(L_101,'#skF_3') ),
inference(demodulation,[status(thm),theory(equality)],[c_221,c_418]) ).
tff(c_440,plain,
convergent_lines('#skF_1','#skF_3'),
inference(resolution,[status(thm)],[c_431,c_46]) ).
tff(c_447,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_44,c_440]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO219+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.13/0.33 % Computer : n009.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Fri Aug 4 00:37:38 EDT 2023
% 0.13/0.33 % CPUTime :
% 3.77/1.90 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.77/1.91
% 3.77/1.91 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.97/1.93
% 3.97/1.93 Inference rules
% 3.97/1.93 ----------------------
% 3.97/1.93 #Ref : 0
% 3.97/1.93 #Sup : 90
% 3.97/1.93 #Fact : 4
% 3.97/1.93 #Define : 0
% 3.97/1.93 #Split : 2
% 3.97/1.93 #Chain : 0
% 3.97/1.93 #Close : 0
% 3.97/1.93
% 3.97/1.93 Ordering : KBO
% 3.97/1.93
% 3.97/1.93 Simplification rules
% 3.97/1.93 ----------------------
% 3.97/1.93 #Subsume : 12
% 3.97/1.93 #Demod : 12
% 3.97/1.93 #Tautology : 13
% 3.97/1.93 #SimpNegUnit : 2
% 3.97/1.93 #BackRed : 0
% 3.97/1.93
% 3.97/1.93 #Partial instantiations: 0
% 3.97/1.93 #Strategies tried : 1
% 3.97/1.93
% 3.97/1.93 Timing (in seconds)
% 3.97/1.93 ----------------------
% 3.97/1.94 Preprocessing : 0.49
% 3.97/1.94 Parsing : 0.27
% 3.97/1.94 CNF conversion : 0.03
% 3.97/1.94 Main loop : 0.41
% 3.97/1.94 Inferencing : 0.17
% 3.97/1.94 Reduction : 0.10
% 3.97/1.94 Demodulation : 0.06
% 3.97/1.94 BG Simplification : 0.02
% 3.97/1.94 Subsumption : 0.11
% 3.97/1.94 Abstraction : 0.01
% 3.97/1.94 MUC search : 0.00
% 3.97/1.94 Cooper : 0.00
% 3.97/1.94 Total : 0.95
% 3.97/1.94 Index Insertion : 0.00
% 3.97/1.94 Index Deletion : 0.00
% 3.97/1.94 Index Matching : 0.00
% 3.97/1.94 BG Taut test : 0.00
%------------------------------------------------------------------------------