TSTP Solution File: GEO216+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO216+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 : n032.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 3.09s 1.72s
% Output : CNFRefutation 3.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 11
% Syntax : Number of formulae : 16 ( 6 unt; 8 typ; 0 def)
% Number of atoms : 10 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 11 ( 9 ~; 1 |; 1 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 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 : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 7 (; 7 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ unorthogonal_lines > distinct_points > distinct_lines > convergent_lines > apart_point_and_line > line_connecting > intersection_point > #nlpp > #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_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/sandbox/benchmark/Axioms/GEO008+0.ax',apart3) ).
tff(f_160,axiom,
! [L,M] :
~ ( ~ convergent_lines(L,M)
& ~ unorthogonal_lines(L,M) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+4.ax',coipo1) ).
tff(f_196,negated_conjecture,
~ ! [L] :
~ ~ unorthogonal_lines(L,L),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
tff(c_6,plain,
! [X_3] : ~ convergent_lines(X_3,X_3),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_46,plain,
! [L_42,M_43] :
( unorthogonal_lines(L_42,M_43)
| convergent_lines(L_42,M_43) ),
inference(cnfTransformation,[status(thm)],[f_160]) ).
tff(c_42,plain,
~ unorthogonal_lines('#skF_1','#skF_1'),
inference(cnfTransformation,[status(thm)],[f_196]) ).
tff(c_49,plain,
convergent_lines('#skF_1','#skF_1'),
inference(resolution,[status(thm)],[c_46,c_42]) ).
tff(c_53,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_6,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GEO216+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/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 : n032.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:31:21 EDT 2023
% 0.13/0.34 % CPUTime :
% 3.09/1.72 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.09/1.73
% 3.09/1.73 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.15/1.75
% 3.15/1.75 Inference rules
% 3.15/1.75 ----------------------
% 3.15/1.75 #Ref : 0
% 3.15/1.75 #Sup : 1
% 3.15/1.75 #Fact : 0
% 3.15/1.75 #Define : 0
% 3.15/1.75 #Split : 0
% 3.15/1.75 #Chain : 0
% 3.15/1.75 #Close : 0
% 3.15/1.75
% 3.15/1.75 Ordering : KBO
% 3.15/1.75
% 3.15/1.75 Simplification rules
% 3.15/1.75 ----------------------
% 3.15/1.75 #Subsume : 1
% 3.15/1.75 #Demod : 0
% 3.15/1.75 #Tautology : 0
% 3.15/1.75 #SimpNegUnit : 1
% 3.15/1.75 #BackRed : 0
% 3.15/1.75
% 3.15/1.75 #Partial instantiations: 0
% 3.15/1.75 #Strategies tried : 1
% 3.15/1.75
% 3.15/1.75 Timing (in seconds)
% 3.15/1.75 ----------------------
% 3.15/1.75 Preprocessing : 0.52
% 3.15/1.75 Parsing : 0.30
% 3.15/1.75 CNF conversion : 0.03
% 3.15/1.75 Main loop : 0.16
% 3.15/1.75 Inferencing : 0.07
% 3.15/1.75 Reduction : 0.02
% 3.15/1.75 Demodulation : 0.01
% 3.15/1.75 BG Simplification : 0.02
% 3.15/1.75 Subsumption : 0.05
% 3.15/1.75 Abstraction : 0.01
% 3.15/1.75 MUC search : 0.00
% 3.15/1.75 Cooper : 0.00
% 3.15/1.75 Total : 0.73
% 3.15/1.76 Index Insertion : 0.00
% 3.15/1.76 Index Deletion : 0.00
% 3.15/1.76 Index Matching : 0.00
% 3.15/1.76 BG Taut test : 0.00
%------------------------------------------------------------------------------