TSTP Solution File: GEO212+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO212+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/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 : n004.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.62s 2.14s
% Output : CNFRefutation 5.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 17
% Syntax : Number of formulae : 38 ( 11 unt; 12 typ; 0 def)
% Number of atoms : 54 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 39 ( 11 ~; 22 |; 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 33 (; 33 !; 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] :
( unorthogonal_lines(L,M)
=> ( convergent_lines(L,N)
| unorthogonal_lines(M,N) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
tff(f_197,axiom,
! [L,M] :
( convergent_lines(L,M)
| unorthogonal_lines(L,M) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+3.ax',occu1) ).
tff(f_81,axiom,
! [X,Y,Z] :
( convergent_lines(X,Y)
=> ( convergent_lines(X,Z)
| convergent_lines(Y,Z) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO008+0.ax',apart6) ).
tff(f_63,axiom,
! [X] : ~ convergent_lines(X,X),
file('/export/starexec/sandbox/benchmark/Axioms/GEO008+0.ax',apart3) ).
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/sandbox/benchmark/Axioms/GEO006+3.ax',oac1) ).
tff(c_54,plain,
~ convergent_lines('#skF_1','#skF_3'),
inference(cnfTransformation,[status(thm)],[f_237]) ).
tff(c_64,plain,
! [L_62,M_63] :
( unorthogonal_lines(L_62,M_63)
| convergent_lines(L_62,M_63) ),
inference(cnfTransformation,[status(thm)],[f_197]) ).
tff(c_52,plain,
~ unorthogonal_lines('#skF_2','#skF_3'),
inference(cnfTransformation,[status(thm)],[f_237]) ).
tff(c_73,plain,
convergent_lines('#skF_2','#skF_3'),
inference(resolution,[status(thm)],[c_64,c_52]) ).
tff(c_82,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_89,plain,
! [Z_74] :
( convergent_lines('#skF_3',Z_74)
| convergent_lines('#skF_2',Z_74) ),
inference(resolution,[status(thm)],[c_73,c_82]) ).
tff(c_12,plain,
! [Y_11,Z_12,X_10] :
( convergent_lines(Y_11,Z_12)
| convergent_lines(X_10,Z_12)
| ~ convergent_lines(X_10,Y_11) ),
inference(cnfTransformation,[status(thm)],[f_81]) ).
tff(c_128,plain,
! [Z_78,Z_79] :
( convergent_lines(Z_78,Z_79)
| convergent_lines('#skF_2',Z_79)
| convergent_lines('#skF_3',Z_78) ),
inference(resolution,[status(thm)],[c_89,c_12]) ).
tff(c_6,plain,
! [X_3] : ~ convergent_lines(X_3,X_3),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_160,plain,
! [Z_82] :
( convergent_lines(Z_82,'#skF_2')
| convergent_lines('#skF_3',Z_82) ),
inference(resolution,[status(thm)],[c_128,c_6]) ).
tff(c_883,plain,
! [Z_150,Z_151] :
( convergent_lines(Z_150,Z_151)
| convergent_lines('#skF_3',Z_151)
| convergent_lines(Z_150,'#skF_2') ),
inference(resolution,[status(thm)],[c_160,c_12]) ).
tff(c_923,plain,
! [Z_150] :
( convergent_lines(Z_150,'#skF_3')
| convergent_lines(Z_150,'#skF_2') ),
inference(resolution,[status(thm)],[c_883,c_6]) ).
tff(c_56,plain,
unorthogonal_lines('#skF_1','#skF_2'),
inference(cnfTransformation,[status(thm)],[f_237]) ).
tff(c_1340,plain,
! [L_181,N_182,M_183] :
( convergent_lines(L_181,N_182)
| unorthogonal_lines(M_183,N_182)
| ~ unorthogonal_lines(L_181,M_183)
| ~ convergent_lines(L_181,M_183) ),
inference(cnfTransformation,[status(thm)],[f_210]) ).
tff(c_1346,plain,
! [N_182] :
( convergent_lines('#skF_1',N_182)
| unorthogonal_lines('#skF_2',N_182)
| ~ convergent_lines('#skF_1','#skF_2') ),
inference(resolution,[status(thm)],[c_56,c_1340]) ).
tff(c_1347,plain,
~ convergent_lines('#skF_1','#skF_2'),
inference(splitLeft,[status(thm)],[c_1346]) ).
tff(c_1352,plain,
convergent_lines('#skF_1','#skF_3'),
inference(resolution,[status(thm)],[c_923,c_1347]) ).
tff(c_1363,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_54,c_1352]) ).
tff(c_1372,plain,
! [N_184] :
( convergent_lines('#skF_1',N_184)
| unorthogonal_lines('#skF_2',N_184) ),
inference(splitRight,[status(thm)],[c_1346]) ).
tff(c_1377,plain,
convergent_lines('#skF_1','#skF_3'),
inference(resolution,[status(thm)],[c_1372,c_52]) ).
tff(c_1382,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_54,c_1377]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO212+2 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13 % 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.13/0.34 % Computer : n004.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri Aug 4 00:21:26 EDT 2023
% 0.13/0.34 % CPUTime :
% 4.62/2.14 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.62/2.15
% 4.62/2.15 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.02/2.18
% 5.02/2.18 Inference rules
% 5.02/2.18 ----------------------
% 5.02/2.18 #Ref : 0
% 5.02/2.18 #Sup : 195
% 5.02/2.18 #Fact : 58
% 5.02/2.18 #Define : 0
% 5.02/2.18 #Split : 1
% 5.02/2.18 #Chain : 0
% 5.02/2.18 #Close : 0
% 5.02/2.18
% 5.02/2.18 Ordering : KBO
% 5.02/2.18
% 5.02/2.18 Simplification rules
% 5.02/2.18 ----------------------
% 5.02/2.18 #Subsume : 67
% 5.02/2.18 #Demod : 52
% 5.02/2.18 #Tautology : 53
% 5.02/2.18 #SimpNegUnit : 16
% 5.02/2.18 #BackRed : 0
% 5.02/2.18
% 5.02/2.18 #Partial instantiations: 0
% 5.02/2.18 #Strategies tried : 1
% 5.02/2.18
% 5.02/2.18 Timing (in seconds)
% 5.02/2.18 ----------------------
% 5.02/2.18 Preprocessing : 0.51
% 5.02/2.18 Parsing : 0.29
% 5.02/2.18 CNF conversion : 0.03
% 5.02/2.18 Main loop : 0.62
% 5.02/2.18 Inferencing : 0.25
% 5.02/2.18 Reduction : 0.15
% 5.02/2.18 Demodulation : 0.09
% 5.02/2.18 BG Simplification : 0.03
% 5.02/2.18 Subsumption : 0.16
% 5.02/2.18 Abstraction : 0.02
% 5.02/2.18 MUC search : 0.00
% 5.02/2.18 Cooper : 0.00
% 5.02/2.18 Total : 1.18
% 5.02/2.18 Index Insertion : 0.00
% 5.02/2.18 Index Deletion : 0.00
% 5.02/2.18 Index Matching : 0.00
% 5.02/2.18 BG Taut test : 0.00
%------------------------------------------------------------------------------