TSTP Solution File: GEO206+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO206+3 : TPTP v8.1.2. Bugfixed v4.0.1.
% 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 : n028.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 4.02s 2.02s
% Output : CNFRefutation 4.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 25
% Syntax : Number of formulae : 39 ( 9 unt; 19 typ; 0 def)
% Number of atoms : 34 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 25 ( 11 ~; 8 |; 1 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 27 (; 27 !; 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)
& parallel_lines(Y,Z) )
=> equal_lines(Y,parallel_through_point(Z,X)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
tff(f_417,axiom,
! [X,Y] :
( parallel_lines(X,Y)
<=> ~ convergent_lines(X,Y) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+6.ax',a3) ).
tff(f_412,axiom,
! [X,Y] :
( equal_lines(X,Y)
<=> ~ distinct_lines(X,Y) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+6.ax',ax2) ).
tff(f_74,axiom,
! [X,Y,Z] :
( distinct_lines(X,Y)
=> ( distinct_lines(X,Z)
| distinct_lines(Y,Z) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',apart5) ).
tff(f_161,axiom,
! [X,Y] :
( distinct_lines(X,Y)
=> convergent_lines(X,Y) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+1.ax',p1) ).
tff(f_189,axiom,
! [X,Y] : ~ convergent_lines(parallel_through_point(Y,X),Y),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+2.ax',cp1) ).
tff(c_96,plain,
parallel_lines('#skF_2','#skF_3'),
inference(cnfTransformation,[status(thm)],[f_436]) ).
tff(c_115,plain,
! [X_101,Y_102] :
( ~ convergent_lines(X_101,Y_102)
| ~ parallel_lines(X_101,Y_102) ),
inference(cnfTransformation,[status(thm)],[f_417]) ).
tff(c_123,plain,
~ convergent_lines('#skF_2','#skF_3'),
inference(resolution,[status(thm)],[c_96,c_115]) ).
tff(c_131,plain,
! [X_107,Y_108] :
( equal_lines(X_107,Y_108)
| distinct_lines(X_107,Y_108) ),
inference(cnfTransformation,[status(thm)],[f_412]) ).
tff(c_94,plain,
~ equal_lines('#skF_2',parallel_through_point('#skF_3','#skF_1')),
inference(cnfTransformation,[status(thm)],[f_436]) ).
tff(c_135,plain,
distinct_lines('#skF_2',parallel_through_point('#skF_3','#skF_1')),
inference(resolution,[status(thm)],[c_131,c_94]) ).
tff(c_237,plain,
! [Y_160,Z_161,X_162] :
( distinct_lines(Y_160,Z_161)
| distinct_lines(X_162,Z_161)
| ~ distinct_lines(X_162,Y_160) ),
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_241,plain,
! [Z_163] :
( distinct_lines(parallel_through_point('#skF_3','#skF_1'),Z_163)
| distinct_lines('#skF_2',Z_163) ),
inference(resolution,[status(thm)],[c_135,c_237]) ).
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_161]) ).
tff(c_255,plain,
! [Z_164] :
( convergent_lines(parallel_through_point('#skF_3','#skF_1'),Z_164)
| distinct_lines('#skF_2',Z_164) ),
inference(resolution,[status(thm)],[c_241,c_30]) ).
tff(c_32,plain,
! [Y_37,X_36] : ~ convergent_lines(parallel_through_point(Y_37,X_36),Y_37),
inference(cnfTransformation,[status(thm)],[f_189]) ).
tff(c_267,plain,
distinct_lines('#skF_2','#skF_3'),
inference(resolution,[status(thm)],[c_255,c_32]) ).
tff(c_326,plain,
convergent_lines('#skF_2','#skF_3'),
inference(resolution,[status(thm)],[c_267,c_30]) ).
tff(c_331,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_123,c_326]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GEO206+3 : TPTP v8.1.2. Bugfixed v4.0.1.
% 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.14/0.36 % Computer : n028.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:58:54 EDT 2023
% 0.14/0.36 % CPUTime :
% 4.02/2.02 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.02/2.02
% 4.02/2.02 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.02/2.05
% 4.02/2.05 Inference rules
% 4.02/2.05 ----------------------
% 4.02/2.05 #Ref : 0
% 4.02/2.05 #Sup : 40
% 4.02/2.05 #Fact : 2
% 4.02/2.05 #Define : 0
% 4.02/2.05 #Split : 0
% 4.02/2.05 #Chain : 0
% 4.02/2.05 #Close : 0
% 4.02/2.05
% 4.02/2.05 Ordering : KBO
% 4.02/2.05
% 4.02/2.05 Simplification rules
% 4.02/2.05 ----------------------
% 4.02/2.05 #Subsume : 4
% 4.02/2.05 #Demod : 7
% 4.02/2.05 #Tautology : 12
% 4.02/2.05 #SimpNegUnit : 1
% 4.02/2.05 #BackRed : 0
% 4.02/2.05
% 4.02/2.05 #Partial instantiations: 0
% 4.02/2.05 #Strategies tried : 1
% 4.02/2.05
% 4.02/2.05 Timing (in seconds)
% 4.02/2.05 ----------------------
% 4.02/2.06 Preprocessing : 0.56
% 4.02/2.06 Parsing : 0.32
% 4.02/2.06 CNF conversion : 0.04
% 4.02/2.06 Main loop : 0.36
% 4.02/2.06 Inferencing : 0.15
% 4.02/2.06 Reduction : 0.09
% 4.02/2.06 Demodulation : 0.06
% 4.02/2.06 BG Simplification : 0.03
% 4.02/2.06 Subsumption : 0.08
% 4.02/2.06 Abstraction : 0.01
% 4.02/2.06 MUC search : 0.00
% 4.02/2.06 Cooper : 0.00
% 4.02/2.06 Total : 0.97
% 4.02/2.06 Index Insertion : 0.00
% 4.02/2.06 Index Deletion : 0.00
% 4.02/2.06 Index Matching : 0.00
% 4.02/2.06 BG Taut test : 0.00
%------------------------------------------------------------------------------