TSTP Solution File: GEO207+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO207+3 : TPTP v8.1.2. Released v4.0.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 : n002.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:40 EDT 2023
% Result : Theorem 3.21s 1.71s
% Output : CNFRefutation 3.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 19
% Syntax : Number of formulae : 22 ( 5 unt; 17 typ; 0 def)
% Number of atoms : 5 ( 0 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 30 ( 16 >; 14 *; 0 +; 0 <<)
% Number of predicates : 13 ( 12 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 3 (; 3 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ unorthogonal_lines > parallel_lines > orthogonal_lines > incident_point_and_line > equal_points > equal_lines > distinct_points > distinct_lines > convergent_lines > apart_point_and_line > point > line > parallel_through_point > orthogonal_through_point > line_connecting > intersection_point > #nlpp > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(line_connecting,type,
line_connecting: ( $i * $i ) > $i ).
tff(equal_lines,type,
equal_lines: ( $i * $i ) > $o ).
tff(equal_points,type,
equal_points: ( $i * $i ) > $o ).
tff(incident_point_and_line,type,
incident_point_and_line: ( $i * $i ) > $o ).
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(point,type,
point: $i > $o ).
tff(line,type,
line: $i > $o ).
tff(parallel_lines,type,
parallel_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(orthogonal_lines,type,
orthogonal_lines: ( $i * $i ) > $o ).
tff(f_59,axiom,
! [X] : ~ convergent_lines(X,X),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',apart3) ).
tff(f_430,negated_conjecture,
~ ! [X] : ~ convergent_lines(X,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
tff(c_6,plain,
! [X_3] : ~ convergent_lines(X_3,X_3),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_94,plain,
convergent_lines('#skF_1','#skF_1'),
inference(cnfTransformation,[status(thm)],[f_430]) ).
tff(c_95,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_6,c_94]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : GEO207+3 : TPTP v8.1.2. Released v4.0.0.
% 0.12/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.36 % Computer : n002.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri Aug 4 00:42:02 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.21/1.71 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.21/1.71
% 3.21/1.71 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.21/1.74
% 3.21/1.74 Inference rules
% 3.21/1.74 ----------------------
% 3.21/1.74 #Ref : 0
% 3.21/1.74 #Sup : 0
% 3.21/1.74 #Fact : 0
% 3.21/1.74 #Define : 0
% 3.21/1.74 #Split : 0
% 3.21/1.74 #Chain : 0
% 3.21/1.74 #Close : 0
% 3.21/1.74
% 3.21/1.74 Ordering : KBO
% 3.21/1.74
% 3.21/1.74 Simplification rules
% 3.21/1.74 ----------------------
% 3.21/1.74 #Subsume : 46
% 3.21/1.74 #Demod : 0
% 3.21/1.74 #Tautology : 0
% 3.21/1.74 #SimpNegUnit : 1
% 3.21/1.74 #BackRed : 0
% 3.21/1.74
% 3.21/1.74 #Partial instantiations: 0
% 3.21/1.74 #Strategies tried : 1
% 3.21/1.74
% 3.21/1.74 Timing (in seconds)
% 3.21/1.74 ----------------------
% 3.21/1.74 Preprocessing : 0.56
% 3.21/1.74 Parsing : 0.32
% 3.21/1.75 CNF conversion : 0.04
% 3.21/1.75 Main loop : 0.13
% 3.21/1.75 Inferencing : 0.00
% 3.21/1.75 Reduction : 0.05
% 3.21/1.75 Demodulation : 0.04
% 3.21/1.75 BG Simplification : 0.03
% 3.21/1.75 Subsumption : 0.05
% 3.21/1.75 Abstraction : 0.01
% 3.21/1.75 MUC search : 0.00
% 3.21/1.75 Cooper : 0.00
% 3.21/1.75 Total : 0.73
% 3.21/1.75 Index Insertion : 0.00
% 3.21/1.75 Index Deletion : 0.00
% 3.21/1.75 Index Matching : 0.00
% 3.21/1.75 BG Taut test : 0.00
%------------------------------------------------------------------------------