TSTP Solution File: GEO226+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO226+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/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 : n008.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:47 EDT 2023
% Result : Theorem 3.65s 1.92s
% Output : CNFRefutation 3.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 22
% Syntax : Number of formulae : 33 ( 3 unt; 18 typ; 0 def)
% Number of atoms : 31 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 29 ( 13 ~; 8 |; 3 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 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 : 21 (; 20 !; 1 ?; 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_441,negated_conjecture,
~ ! [L,M] :
( ( line(L)
& line(M)
& convergent_lines(L,M) )
=> ? [X] :
( point(X)
=> ( incident_point_and_line(X,L)
& incident_point_and_line(X,M) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
tff(f_420,axiom,
! [X,Y] :
( incident_point_and_line(X,Y)
<=> ~ apart_point_and_line(X,Y) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+6.ax',a4) ).
tff(f_99,axiom,
! [X,Y] :
( convergent_lines(X,Y)
=> ~ apart_point_and_line(intersection_point(X,Y),Y) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ci4) ).
tff(f_94,axiom,
! [X,Y] :
( convergent_lines(X,Y)
=> ~ apart_point_and_line(intersection_point(X,Y),X) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ci3) ).
tff(c_98,plain,
convergent_lines('#skF_1','#skF_2'),
inference(cnfTransformation,[status(thm)],[f_441]) ).
tff(c_88,plain,
! [X_78,Y_79] :
( incident_point_and_line(X_78,Y_79)
| apart_point_and_line(X_78,Y_79) ),
inference(cnfTransformation,[status(thm)],[f_420]) ).
tff(c_119,plain,
! [X_97,Y_98] :
( incident_point_and_line(X_97,Y_98)
| apart_point_and_line(X_97,Y_98) ),
inference(cnfTransformation,[status(thm)],[f_420]) ).
tff(c_96,plain,
! [X_83] :
( ~ incident_point_and_line(X_83,'#skF_2')
| ~ incident_point_and_line(X_83,'#skF_1') ),
inference(cnfTransformation,[status(thm)],[f_441]) ).
tff(c_139,plain,
! [X_111] :
( ~ incident_point_and_line(X_111,'#skF_1')
| apart_point_and_line(X_111,'#skF_2') ),
inference(resolution,[status(thm)],[c_119,c_96]) ).
tff(c_144,plain,
! [X_78] :
( apart_point_and_line(X_78,'#skF_2')
| apart_point_and_line(X_78,'#skF_1') ),
inference(resolution,[status(thm)],[c_88,c_139]) ).
tff(c_188,plain,
! [X_135,Y_136] :
( ~ apart_point_and_line(intersection_point(X_135,Y_136),Y_136)
| ~ convergent_lines(X_135,Y_136) ),
inference(cnfTransformation,[status(thm)],[f_99]) ).
tff(c_202,plain,
! [X_143] :
( ~ convergent_lines(X_143,'#skF_2')
| apart_point_and_line(intersection_point(X_143,'#skF_2'),'#skF_1') ),
inference(resolution,[status(thm)],[c_144,c_188]) ).
tff(c_18,plain,
! [X_17,Y_18] :
( ~ apart_point_and_line(intersection_point(X_17,Y_18),X_17)
| ~ convergent_lines(X_17,Y_18) ),
inference(cnfTransformation,[status(thm)],[f_94]) ).
tff(c_206,plain,
~ convergent_lines('#skF_1','#skF_2'),
inference(resolution,[status(thm)],[c_202,c_18]) ).
tff(c_210,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_98,c_206]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO226+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/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.14/0.35 % Computer : n008.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri Aug 4 00:29:33 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.65/1.92 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.65/1.93
% 3.65/1.93 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.99/1.95
% 3.99/1.95 Inference rules
% 3.99/1.95 ----------------------
% 3.99/1.95 #Ref : 0
% 3.99/1.95 #Sup : 14
% 3.99/1.95 #Fact : 0
% 3.99/1.95 #Define : 0
% 3.99/1.95 #Split : 0
% 3.99/1.95 #Chain : 0
% 3.99/1.95 #Close : 0
% 3.99/1.95
% 3.99/1.95 Ordering : KBO
% 3.99/1.95
% 3.99/1.95 Simplification rules
% 3.99/1.95 ----------------------
% 3.99/1.95 #Subsume : 3
% 3.99/1.95 #Demod : 7
% 3.99/1.95 #Tautology : 7
% 3.99/1.95 #SimpNegUnit : 0
% 3.99/1.95 #BackRed : 0
% 3.99/1.95
% 3.99/1.95 #Partial instantiations: 0
% 3.99/1.95 #Strategies tried : 1
% 3.99/1.95
% 3.99/1.95 Timing (in seconds)
% 3.99/1.95 ----------------------
% 3.99/1.95 Preprocessing : 0.56
% 3.99/1.95 Parsing : 0.32
% 3.99/1.95 CNF conversion : 0.04
% 3.99/1.95 Main loop : 0.32
% 3.99/1.95 Inferencing : 0.12
% 3.99/1.96 Reduction : 0.09
% 3.99/1.96 Demodulation : 0.06
% 3.99/1.96 BG Simplification : 0.03
% 3.99/1.96 Subsumption : 0.07
% 3.99/1.96 Abstraction : 0.01
% 3.99/1.96 MUC search : 0.00
% 3.99/1.96 Cooper : 0.00
% 3.99/1.96 Total : 0.92
% 3.99/1.96 Index Insertion : 0.00
% 3.99/1.96 Index Deletion : 0.00
% 3.99/1.96 Index Matching : 0.00
% 3.99/1.96 BG Taut test : 0.00
%------------------------------------------------------------------------------