TSTP Solution File: GEO192+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO192+2 : TPTP v8.1.2. Released v3.3.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 : n031.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:33 EDT 2023
% Result : Theorem 4.01s 2.10s
% Output : CNFRefutation 4.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 15
% Syntax : Number of formulae : 41 ( 14 unt; 9 typ; 0 def)
% Number of atoms : 61 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 51 ( 22 ~; 22 |; 1 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 12 ( 6 >; 6 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 39 (; 39 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ distinct_points > distinct_lines > convergent_lines > apart_point_and_line > 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(distinct_points,type,
distinct_points: ( $i * $i ) > $o ).
tff(intersection_point,type,
intersection_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('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(distinct_lines,type,
distinct_lines: ( $i * $i ) > $o ).
tff(f_61,axiom,
! [X] : ~ distinct_lines(X,X),
file('/export/starexec/sandbox/benchmark/Axioms/GEO008+0.ax',apart2) ).
tff(f_140,negated_conjecture,
~ ! [X,Y,Z] :
( convergent_lines(X,Y)
=> ( apart_point_and_line(intersection_point(X,Y),Z)
=> ( distinct_lines(X,Z)
& distinct_lines(Y,Z) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
tff(f_125,axiom,
! [X,Y,Z] :
( apart_point_and_line(X,Y)
=> ( distinct_lines(Y,Z)
| apart_point_and_line(X,Z) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO008+0.ax',ceq2) ).
tff(f_99,axiom,
! [X,Y,Z] :
( convergent_lines(X,Y)
=> ( ( apart_point_and_line(Z,X)
| apart_point_and_line(Z,Y) )
=> distinct_points(Z,intersection_point(X,Y)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO008+0.ax',con2) ).
tff(f_58,axiom,
! [X] : ~ distinct_points(X,X),
file('/export/starexec/sandbox/benchmark/Axioms/GEO008+0.ax',apart1) ).
tff(f_76,axiom,
! [X,Y,Z] :
( distinct_lines(X,Y)
=> ( distinct_lines(X,Z)
| distinct_lines(Y,Z) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO008+0.ax',apart5) ).
tff(c_4,plain,
! [X_2] : ~ distinct_lines(X_2,X_2),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_34,plain,
convergent_lines('#skF_1','#skF_2'),
inference(cnfTransformation,[status(thm)],[f_140]) ).
tff(c_32,plain,
apart_point_and_line(intersection_point('#skF_1','#skF_2'),'#skF_3'),
inference(cnfTransformation,[status(thm)],[f_140]) ).
tff(c_1107,plain,
! [X_129,Z_130,Y_131] :
( apart_point_and_line(X_129,Z_130)
| distinct_lines(Y_131,Z_130)
| ~ apart_point_and_line(X_129,Y_131) ),
inference(cnfTransformation,[status(thm)],[f_125]) ).
tff(c_1110,plain,
! [Z_130] :
( apart_point_and_line(intersection_point('#skF_1','#skF_2'),Z_130)
| distinct_lines('#skF_3',Z_130) ),
inference(resolution,[status(thm)],[c_32,c_1107]) ).
tff(c_1534,plain,
! [Z_163,Y_164,X_165] :
( ~ apart_point_and_line(Z_163,Y_164)
| distinct_points(Z_163,intersection_point(X_165,Y_164))
| ~ convergent_lines(X_165,Y_164) ),
inference(cnfTransformation,[status(thm)],[f_99]) ).
tff(c_2,plain,
! [X_1] : ~ distinct_points(X_1,X_1),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_1543,plain,
! [X_166,Y_167] :
( ~ apart_point_and_line(intersection_point(X_166,Y_167),Y_167)
| ~ convergent_lines(X_166,Y_167) ),
inference(resolution,[status(thm)],[c_1534,c_2]) ).
tff(c_1551,plain,
( ~ convergent_lines('#skF_1','#skF_2')
| distinct_lines('#skF_3','#skF_2') ),
inference(resolution,[status(thm)],[c_1110,c_1543]) ).
tff(c_1555,plain,
distinct_lines('#skF_3','#skF_2'),
inference(demodulation,[status(thm),theory(equality)],[c_34,c_1551]) ).
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_76]) ).
tff(c_1559,plain,
! [Z_168] :
( distinct_lines('#skF_2',Z_168)
| distinct_lines('#skF_3',Z_168) ),
inference(resolution,[status(thm)],[c_1555,c_10]) ).
tff(c_30,plain,
( ~ distinct_lines('#skF_2','#skF_3')
| ~ distinct_lines('#skF_1','#skF_3') ),
inference(cnfTransformation,[status(thm)],[f_140]) ).
tff(c_44,plain,
~ distinct_lines('#skF_1','#skF_3'),
inference(splitLeft,[status(thm)],[c_30]) ).
tff(c_49,plain,
! [X_36,Z_37,Y_38] :
( apart_point_and_line(X_36,Z_37)
| distinct_lines(Y_38,Z_37)
| ~ apart_point_and_line(X_36,Y_38) ),
inference(cnfTransformation,[status(thm)],[f_125]) ).
tff(c_52,plain,
! [Z_37] :
( apart_point_and_line(intersection_point('#skF_1','#skF_2'),Z_37)
| distinct_lines('#skF_3',Z_37) ),
inference(resolution,[status(thm)],[c_32,c_49]) ).
tff(c_902,plain,
! [Z_107,X_108,Y_109] :
( ~ apart_point_and_line(Z_107,X_108)
| distinct_points(Z_107,intersection_point(X_108,Y_109))
| ~ convergent_lines(X_108,Y_109) ),
inference(cnfTransformation,[status(thm)],[f_99]) ).
tff(c_911,plain,
! [X_110,Y_111] :
( ~ apart_point_and_line(intersection_point(X_110,Y_111),X_110)
| ~ convergent_lines(X_110,Y_111) ),
inference(resolution,[status(thm)],[c_902,c_2]) ).
tff(c_923,plain,
( ~ convergent_lines('#skF_1','#skF_2')
| distinct_lines('#skF_3','#skF_1') ),
inference(resolution,[status(thm)],[c_52,c_911]) ).
tff(c_930,plain,
distinct_lines('#skF_3','#skF_1'),
inference(demodulation,[status(thm),theory(equality)],[c_34,c_923]) ).
tff(c_961,plain,
! [Z_115] :
( distinct_lines('#skF_1',Z_115)
| distinct_lines('#skF_3',Z_115) ),
inference(resolution,[status(thm)],[c_930,c_10]) ).
tff(c_967,plain,
distinct_lines('#skF_1','#skF_3'),
inference(resolution,[status(thm)],[c_961,c_4]) ).
tff(c_972,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_44,c_967]) ).
tff(c_973,plain,
~ distinct_lines('#skF_2','#skF_3'),
inference(splitRight,[status(thm)],[c_30]) ).
tff(c_1564,plain,
distinct_lines('#skF_3','#skF_3'),
inference(resolution,[status(thm)],[c_1559,c_973]) ).
tff(c_1573,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_4,c_1564]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.14 % Problem : GEO192+2 : TPTP v8.1.2. Released v3.3.0.
% 0.11/0.15 % 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 : n031.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:38:15 EDT 2023
% 0.14/0.36 % CPUTime :
% 4.01/2.10 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.75/2.11
% 4.75/2.11 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.75/2.14
% 4.75/2.14 Inference rules
% 4.75/2.14 ----------------------
% 4.75/2.14 #Ref : 0
% 4.75/2.14 #Sup : 268
% 4.75/2.14 #Fact : 42
% 4.75/2.14 #Define : 0
% 4.75/2.14 #Split : 1
% 4.75/2.14 #Chain : 0
% 4.75/2.14 #Close : 0
% 4.75/2.14
% 4.75/2.14 Ordering : KBO
% 4.75/2.14
% 4.75/2.14 Simplification rules
% 4.75/2.14 ----------------------
% 4.75/2.14 #Subsume : 42
% 4.75/2.14 #Demod : 79
% 4.75/2.14 #Tautology : 74
% 4.75/2.14 #SimpNegUnit : 3
% 4.75/2.14 #BackRed : 0
% 4.75/2.14
% 4.75/2.14 #Partial instantiations: 0
% 4.75/2.14 #Strategies tried : 1
% 4.75/2.14
% 4.75/2.14 Timing (in seconds)
% 4.75/2.14 ----------------------
% 4.75/2.14 Preprocessing : 0.47
% 4.75/2.14 Parsing : 0.26
% 4.75/2.14 CNF conversion : 0.03
% 4.75/2.14 Main loop : 0.64
% 4.75/2.14 Inferencing : 0.27
% 4.75/2.14 Reduction : 0.15
% 4.75/2.14 Demodulation : 0.09
% 4.75/2.14 BG Simplification : 0.03
% 4.75/2.15 Subsumption : 0.15
% 4.75/2.15 Abstraction : 0.02
% 4.75/2.15 MUC search : 0.00
% 4.75/2.15 Cooper : 0.00
% 4.75/2.15 Total : 1.16
% 4.75/2.15 Index Insertion : 0.00
% 4.75/2.15 Index Deletion : 0.00
% 4.75/2.15 Index Matching : 0.00
% 4.75/2.15 BG Taut test : 0.00
%------------------------------------------------------------------------------