TSTP Solution File: GEO171+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO171+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 : n027.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:24 EDT 2023
% Result : Theorem 3.92s 1.96s
% Output : CNFRefutation 3.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 23
% Syntax : Number of formulae : 34 ( 8 unt; 18 typ; 0 def)
% Number of atoms : 29 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 21 ( 8 ~; 10 |; 0 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 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 : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 22 (; 22 !; 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_2 > #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_2',type,
'#skF_2': $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(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_431,negated_conjecture,
~ ! [X,Y] :
( convergent_lines(X,Y)
=> distinct_lines(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
tff(f_130,axiom,
! [X,Y,Z] :
( convergent_lines(X,Y)
=> ( distinct_lines(Y,Z)
| convergent_lines(X,Z) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ceq3) ).
tff(f_71,axiom,
! [X,Y,Z] :
( distinct_lines(X,Y)
=> ( distinct_lines(X,Z)
| distinct_lines(Y,Z) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',apart5) ).
tff(f_56,axiom,
! [X] : ~ distinct_lines(X,X),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',apart2) ).
tff(c_6,plain,
! [X_3] : ~ convergent_lines(X_3,X_3),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_96,plain,
convergent_lines('#skF_1','#skF_2'),
inference(cnfTransformation,[status(thm)],[f_431]) ).
tff(c_166,plain,
! [X_141,Z_142,Y_143] :
( convergent_lines(X_141,Z_142)
| distinct_lines(Y_143,Z_142)
| ~ convergent_lines(X_141,Y_143) ),
inference(cnfTransformation,[status(thm)],[f_130]) ).
tff(c_173,plain,
! [Z_144] :
( convergent_lines('#skF_1',Z_144)
| distinct_lines('#skF_2',Z_144) ),
inference(resolution,[status(thm)],[c_96,c_166]) ).
tff(c_10,plain,
! [Y_8,Z_9,X_7] :
( distinct_lines(Y_8,Z_9)
| distinct_lines(X_7,Z_9)
| ~ distinct_lines(X_7,Y_8) ),
inference(cnfTransformation,[status(thm)],[f_71]) ).
tff(c_300,plain,
! [Z_174,Z_175] :
( distinct_lines(Z_174,Z_175)
| distinct_lines('#skF_2',Z_175)
| convergent_lines('#skF_1',Z_174) ),
inference(resolution,[status(thm)],[c_173,c_10]) ).
tff(c_4,plain,
! [X_2] : ~ distinct_lines(X_2,X_2),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_326,plain,
! [Z_176] :
( distinct_lines(Z_176,'#skF_2')
| convergent_lines('#skF_1',Z_176) ),
inference(resolution,[status(thm)],[c_300,c_4]) ).
tff(c_94,plain,
~ distinct_lines('#skF_1','#skF_2'),
inference(cnfTransformation,[status(thm)],[f_431]) ).
tff(c_338,plain,
convergent_lines('#skF_1','#skF_1'),
inference(resolution,[status(thm)],[c_326,c_94]) ).
tff(c_346,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_6,c_338]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO171+3 : TPTP v8.1.2. Released v4.0.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.14/0.34 % Computer : n027.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Fri Aug 4 01:11:24 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.92/1.96 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.92/1.97
% 3.92/1.97 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.92/1.99
% 3.92/1.99 Inference rules
% 3.92/1.99 ----------------------
% 3.92/1.99 #Ref : 0
% 3.92/1.99 #Sup : 45
% 3.92/1.99 #Fact : 2
% 3.92/1.99 #Define : 0
% 3.92/1.99 #Split : 0
% 3.92/1.99 #Chain : 0
% 3.92/1.99 #Close : 0
% 3.92/1.99
% 3.92/1.99 Ordering : KBO
% 3.92/1.99
% 3.92/1.99 Simplification rules
% 3.92/1.99 ----------------------
% 3.92/1.99 #Subsume : 5
% 3.92/1.99 #Demod : 6
% 3.92/1.99 #Tautology : 11
% 3.92/1.99 #SimpNegUnit : 1
% 3.92/1.99 #BackRed : 0
% 3.92/1.99
% 3.92/1.99 #Partial instantiations: 0
% 3.92/1.99 #Strategies tried : 1
% 3.92/1.99
% 3.92/1.99 Timing (in seconds)
% 3.92/1.99 ----------------------
% 3.92/2.00 Preprocessing : 0.57
% 3.92/2.00 Parsing : 0.32
% 3.92/2.00 CNF conversion : 0.04
% 3.92/2.00 Main loop : 0.37
% 3.92/2.00 Inferencing : 0.15
% 3.92/2.00 Reduction : 0.09
% 3.92/2.00 Demodulation : 0.06
% 3.92/2.00 BG Simplification : 0.03
% 3.92/2.00 Subsumption : 0.09
% 3.92/2.00 Abstraction : 0.01
% 3.92/2.00 MUC search : 0.00
% 3.92/2.00 Cooper : 0.00
% 3.92/2.00 Total : 0.98
% 3.92/2.00 Index Insertion : 0.00
% 3.92/2.00 Index Deletion : 0.00
% 3.92/2.00 Index Matching : 0.00
% 3.92/2.00 BG Taut test : 0.00
%------------------------------------------------------------------------------