TSTP Solution File: GEO192+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO192+1 : 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 : n010.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 3.42s 1.85s
% Output : CNFRefutation 3.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 15
% Syntax : Number of formulae : 38 ( 12 unt; 9 typ; 0 def)
% Number of atoms : 53 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 42 ( 18 ~; 17 |; 1 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 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 : 32 (; 32 !; 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_57,axiom,
! [X] : ~ distinct_lines(X,X),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',apart2) ).
tff(f_142,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/GEO006+0.ax',ceq2) ).
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_72,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_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_4,plain,
! [X_2] : ~ distinct_lines(X_2,X_2),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_34,plain,
convergent_lines('#skF_1','#skF_2'),
inference(cnfTransformation,[status(thm)],[f_142]) ).
tff(c_32,plain,
apart_point_and_line(intersection_point('#skF_1','#skF_2'),'#skF_3'),
inference(cnfTransformation,[status(thm)],[f_142]) ).
tff(c_249,plain,
! [X_78,Z_79,Y_80] :
( apart_point_and_line(X_78,Z_79)
| distinct_lines(Y_80,Z_79)
| ~ apart_point_and_line(X_78,Y_80) ),
inference(cnfTransformation,[status(thm)],[f_125]) ).
tff(c_253,plain,
! [Z_81] :
( apart_point_and_line(intersection_point('#skF_1','#skF_2'),Z_81)
| distinct_lines('#skF_3',Z_81) ),
inference(resolution,[status(thm)],[c_32,c_249]) ).
tff(c_20,plain,
! [X_19,Y_20] :
( ~ apart_point_and_line(intersection_point(X_19,Y_20),Y_20)
| ~ convergent_lines(X_19,Y_20) ),
inference(cnfTransformation,[status(thm)],[f_99]) ).
tff(c_263,plain,
( ~ convergent_lines('#skF_1','#skF_2')
| distinct_lines('#skF_3','#skF_2') ),
inference(resolution,[status(thm)],[c_253,c_20]) ).
tff(c_276,plain,
distinct_lines('#skF_3','#skF_2'),
inference(demodulation,[status(thm),theory(equality)],[c_34,c_263]) ).
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_72]) ).
tff(c_341,plain,
! [Z_88] :
( distinct_lines('#skF_2',Z_88)
| distinct_lines('#skF_3',Z_88) ),
inference(resolution,[status(thm)],[c_276,c_10]) ).
tff(c_30,plain,
( ~ distinct_lines('#skF_2','#skF_3')
| ~ distinct_lines('#skF_1','#skF_3') ),
inference(cnfTransformation,[status(thm)],[f_142]) ).
tff(c_38,plain,
~ distinct_lines('#skF_1','#skF_3'),
inference(splitLeft,[status(thm)],[c_30]) ).
tff(c_55,plain,
! [X_52,Z_53,Y_54] :
( apart_point_and_line(X_52,Z_53)
| distinct_lines(Y_54,Z_53)
| ~ apart_point_and_line(X_52,Y_54) ),
inference(cnfTransformation,[status(thm)],[f_125]) ).
tff(c_63,plain,
! [Z_58] :
( apart_point_and_line(intersection_point('#skF_1','#skF_2'),Z_58)
| distinct_lines('#skF_3',Z_58) ),
inference(resolution,[status(thm)],[c_32,c_55]) ).
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_83,plain,
( ~ convergent_lines('#skF_1','#skF_2')
| distinct_lines('#skF_3','#skF_1') ),
inference(resolution,[status(thm)],[c_63,c_18]) ).
tff(c_93,plain,
distinct_lines('#skF_3','#skF_1'),
inference(demodulation,[status(thm),theory(equality)],[c_34,c_83]) ).
tff(c_133,plain,
! [Z_61] :
( distinct_lines('#skF_1',Z_61)
| distinct_lines('#skF_3',Z_61) ),
inference(resolution,[status(thm)],[c_93,c_10]) ).
tff(c_139,plain,
distinct_lines('#skF_1','#skF_3'),
inference(resolution,[status(thm)],[c_133,c_4]) ).
tff(c_144,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_38,c_139]) ).
tff(c_145,plain,
~ distinct_lines('#skF_2','#skF_3'),
inference(splitRight,[status(thm)],[c_30]) ).
tff(c_346,plain,
distinct_lines('#skF_3','#skF_3'),
inference(resolution,[status(thm)],[c_341,c_145]) ).
tff(c_355,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_4,c_346]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GEO192+1 : TPTP v8.1.2. Released v3.3.0.
% 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.35 % Computer : n010.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:20:43 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.42/1.85 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.42/1.85
% 3.42/1.85 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.42/1.88
% 3.42/1.88 Inference rules
% 3.42/1.88 ----------------------
% 3.42/1.88 #Ref : 0
% 3.42/1.88 #Sup : 54
% 3.42/1.88 #Fact : 6
% 3.42/1.88 #Define : 0
% 3.42/1.88 #Split : 1
% 3.42/1.88 #Chain : 0
% 3.42/1.88 #Close : 0
% 3.42/1.88
% 3.42/1.88 Ordering : KBO
% 3.42/1.88
% 3.42/1.88 Simplification rules
% 3.42/1.88 ----------------------
% 3.42/1.88 #Subsume : 4
% 3.42/1.88 #Demod : 17
% 3.42/1.88 #Tautology : 13
% 3.42/1.88 #SimpNegUnit : 3
% 3.42/1.88 #BackRed : 0
% 3.42/1.88
% 3.42/1.88 #Partial instantiations: 0
% 3.42/1.88 #Strategies tried : 1
% 3.42/1.88
% 3.42/1.88 Timing (in seconds)
% 3.42/1.88 ----------------------
% 3.42/1.88 Preprocessing : 0.47
% 3.42/1.88 Parsing : 0.26
% 3.42/1.88 CNF conversion : 0.03
% 3.42/1.89 Main loop : 0.36
% 3.42/1.89 Inferencing : 0.15
% 3.42/1.89 Reduction : 0.08
% 3.42/1.89 Demodulation : 0.05
% 3.42/1.89 BG Simplification : 0.02
% 3.42/1.89 Subsumption : 0.09
% 3.42/1.89 Abstraction : 0.01
% 3.42/1.89 MUC search : 0.00
% 3.42/1.89 Cooper : 0.00
% 3.42/1.89 Total : 0.88
% 3.42/1.89 Index Insertion : 0.00
% 3.42/1.89 Index Deletion : 0.00
% 3.42/1.89 Index Matching : 0.00
% 3.42/1.89 BG Taut test : 0.00
%------------------------------------------------------------------------------