TSTP Solution File: GEO208+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO208+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 : n023.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.55s 1.82s
% Output : CNFRefutation 3.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 23
% Syntax : Number of formulae : 32 ( 6 unt; 19 typ; 0 def)
% Number of atoms : 22 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 17 ( 8 ~; 3 |; 2 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 15 (; 15 !; 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_3 > #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_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(orthogonal_lines,type,
orthogonal_lines: ( $i * $i ) > $o ).
tff(f_436,negated_conjecture,
~ ! [X,Y,Z] :
( ( incident_point_and_line(X,Y)
& incident_point_and_line(X,Z)
& parallel_lines(Y,Z) )
=> equal_lines(Y,Z) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
tff(f_415,axiom,
! [X,Y] :
( parallel_lines(X,Y)
<=> ~ convergent_lines(X,Y) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+6.ax',a3) ).
tff(f_410,axiom,
! [X,Y] :
( equal_lines(X,Y)
<=> ~ distinct_lines(X,Y) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+6.ax',ax2) ).
tff(f_159,axiom,
! [X,Y] :
( distinct_lines(X,Y)
=> convergent_lines(X,Y) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+1.ax',p1) ).
tff(c_96,plain,
parallel_lines('#skF_2','#skF_3'),
inference(cnfTransformation,[status(thm)],[f_436]) ).
tff(c_126,plain,
! [X_103,Y_104] :
( ~ convergent_lines(X_103,Y_104)
| ~ parallel_lines(X_103,Y_104) ),
inference(cnfTransformation,[status(thm)],[f_415]) ).
tff(c_134,plain,
~ convergent_lines('#skF_2','#skF_3'),
inference(resolution,[status(thm)],[c_96,c_126]) ).
tff(c_136,plain,
! [X_107,Y_108] :
( equal_lines(X_107,Y_108)
| distinct_lines(X_107,Y_108) ),
inference(cnfTransformation,[status(thm)],[f_410]) ).
tff(c_94,plain,
~ equal_lines('#skF_2','#skF_3'),
inference(cnfTransformation,[status(thm)],[f_436]) ).
tff(c_140,plain,
distinct_lines('#skF_2','#skF_3'),
inference(resolution,[status(thm)],[c_136,c_94]) ).
tff(c_30,plain,
! [X_34,Y_35] :
( convergent_lines(X_34,Y_35)
| ~ distinct_lines(X_34,Y_35) ),
inference(cnfTransformation,[status(thm)],[f_159]) ).
tff(c_143,plain,
convergent_lines('#skF_2','#skF_3'),
inference(resolution,[status(thm)],[c_140,c_30]) ).
tff(c_147,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_134,c_143]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GEO208+3 : TPTP v8.1.2. Released v4.0.0.
% 0.13/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.13/0.35 % Computer : n023.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri Aug 4 00:31:52 EDT 2023
% 0.13/0.36 % CPUTime :
% 3.55/1.82 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.55/1.82
% 3.55/1.82 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.76/1.84
% 3.76/1.84 Inference rules
% 3.76/1.84 ----------------------
% 3.76/1.84 #Ref : 0
% 3.76/1.84 #Sup : 7
% 3.76/1.84 #Fact : 0
% 3.76/1.84 #Define : 0
% 3.76/1.84 #Split : 0
% 3.76/1.84 #Chain : 0
% 3.76/1.84 #Close : 0
% 3.76/1.84
% 3.76/1.84 Ordering : KBO
% 3.76/1.84
% 3.76/1.84 Simplification rules
% 3.76/1.84 ----------------------
% 3.76/1.84 #Subsume : 3
% 3.76/1.84 #Demod : 0
% 3.76/1.84 #Tautology : 1
% 3.76/1.84 #SimpNegUnit : 1
% 3.76/1.84 #BackRed : 0
% 3.76/1.84
% 3.76/1.84 #Partial instantiations: 0
% 3.76/1.84 #Strategies tried : 1
% 3.76/1.84
% 3.76/1.84 Timing (in seconds)
% 3.76/1.84 ----------------------
% 3.76/1.85 Preprocessing : 0.55
% 3.76/1.85 Parsing : 0.31
% 3.76/1.85 CNF conversion : 0.04
% 3.76/1.85 Main loop : 0.25
% 3.76/1.85 Inferencing : 0.09
% 3.76/1.85 Reduction : 0.06
% 3.76/1.85 Demodulation : 0.04
% 3.76/1.85 BG Simplification : 0.03
% 3.76/1.85 Subsumption : 0.06
% 3.76/1.85 Abstraction : 0.01
% 3.76/1.85 MUC search : 0.00
% 3.76/1.85 Cooper : 0.00
% 3.76/1.85 Total : 0.84
% 3.76/1.85 Index Insertion : 0.00
% 3.76/1.85 Index Deletion : 0.00
% 3.76/1.85 Index Matching : 0.00
% 3.76/1.85 BG Taut test : 0.00
%------------------------------------------------------------------------------