TSTP Solution File: GEO228+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO228+1 : TPTP v8.1.2. Bugfixed v6.4.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 : n002.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.73s 1.87s
% Output : CNFRefutation 3.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 24
% Syntax : Number of formulae : 46 ( 11 unt; 20 typ; 0 def)
% Number of atoms : 47 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 45 ( 24 ~; 16 |; 2 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 33 ( 16 >; 17 *; 0 +; 0 <<)
% Number of predicates : 13 ( 12 usr; 1 prp; 0-4 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 32 (; 32 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ between_on_line > divides_points > before_on_line > unequally_directed_lines > left_convergent_lines > left_apart_point > distinct_points > distinct_lines > convergent_lines > apart_point_and_line > point > line > parallel_through_point > line_connecting > intersection_point > #nlpp > reverse_line > #skF_2 > #skF_3 > #skF_1 > #skF_4
%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(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(point,type,
point: $i > $o ).
tff(reverse_line,type,
reverse_line: $i > $i ).
tff(line,type,
line: $i > $o ).
tff(between_on_line,type,
between_on_line: ( $i * $i * $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(left_convergent_lines,type,
left_convergent_lines: ( $i * $i ) > $o ).
tff(distinct_lines,type,
distinct_lines: ( $i * $i ) > $o ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(before_on_line,type,
before_on_line: ( $i * $i * $i ) > $o ).
tff(divides_points,type,
divides_points: ( $i * $i * $i ) > $o ).
tff(left_apart_point,type,
left_apart_point: ( $i * $i ) > $o ).
tff(unequally_directed_lines,type,
unequally_directed_lines: ( $i * $i ) > $o ).
tff(f_63,axiom,
! [L,M] :
( convergent_lines(L,M)
<=> ( unequally_directed_lines(L,M)
& unequally_directed_lines(L,reverse_line(M)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',con_def) ).
tff(f_166,axiom,
! [L,M] :
~ ( left_convergent_lines(L,M)
| left_convergent_lines(L,reverse_line(M)) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oag11) ).
tff(f_156,axiom,
! [L,M] :
( ( unequally_directed_lines(L,M)
& unequally_directed_lines(L,reverse_line(M)) )
=> ( left_convergent_lines(L,M)
| left_convergent_lines(L,reverse_line(M)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oag9) ).
tff(f_287,negated_conjecture,
~ ! [L,M] :
( ~ convergent_lines(L,M)
<=> ( ~ unequally_directed_lines(L,M)
| ~ unequally_directed_lines(L,reverse_line(M)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
tff(c_12,plain,
! [L_3,M_4] :
( unequally_directed_lines(L_3,M_4)
| ~ convergent_lines(L_3,M_4) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_261,plain,
! [L_118,M_119] :
( unequally_directed_lines(L_118,reverse_line(M_119))
| ~ convergent_lines(L_118,M_119) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_80,plain,
! [L_36,M_37] : ~ left_convergent_lines(L_36,M_37),
inference(cnfTransformation,[status(thm)],[f_166]) ).
tff(c_74,plain,
! [L_32,M_33] :
( left_convergent_lines(L_32,reverse_line(M_33))
| left_convergent_lines(L_32,M_33)
| ~ unequally_directed_lines(L_32,reverse_line(M_33))
| ~ unequally_directed_lines(L_32,M_33) ),
inference(cnfTransformation,[status(thm)],[f_156]) ).
tff(c_136,plain,
! [L_32,M_33] :
( ~ unequally_directed_lines(L_32,reverse_line(M_33))
| ~ unequally_directed_lines(L_32,M_33) ),
inference(negUnitSimplification,[status(thm)],[c_80,c_80,c_74]) ).
tff(c_277,plain,
! [L_121,M_122] :
( ~ unequally_directed_lines(L_121,M_122)
| ~ convergent_lines(L_121,M_122) ),
inference(resolution,[status(thm)],[c_261,c_136]) ).
tff(c_285,plain,
! [L_3,M_4] : ~ convergent_lines(L_3,M_4),
inference(resolution,[status(thm)],[c_12,c_277]) ).
tff(c_10,plain,
! [L_3,M_4] :
( unequally_directed_lines(L_3,reverse_line(M_4))
| ~ convergent_lines(L_3,M_4) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_206,plain,
! [L_102,M_103] :
( ~ unequally_directed_lines(L_102,reverse_line(M_103))
| ~ unequally_directed_lines(L_102,M_103) ),
inference(negUnitSimplification,[status(thm)],[c_80,c_80,c_74]) ).
tff(c_218,plain,
! [L_107,M_108] :
( ~ unequally_directed_lines(L_107,M_108)
| ~ convergent_lines(L_107,M_108) ),
inference(resolution,[status(thm)],[c_10,c_206]) ).
tff(c_229,plain,
! [L_3,M_4] : ~ convergent_lines(L_3,M_4),
inference(resolution,[status(thm)],[c_12,c_218]) ).
tff(c_122,plain,
( convergent_lines('#skF_1','#skF_2')
| unequally_directed_lines('#skF_3','#skF_4') ),
inference(cnfTransformation,[status(thm)],[f_287]) ).
tff(c_154,plain,
unequally_directed_lines('#skF_3','#skF_4'),
inference(splitLeft,[status(thm)],[c_122]) ).
tff(c_118,plain,
( convergent_lines('#skF_1','#skF_2')
| unequally_directed_lines('#skF_3',reverse_line('#skF_4')) ),
inference(cnfTransformation,[status(thm)],[f_287]) ).
tff(c_170,plain,
unequally_directed_lines('#skF_3',reverse_line('#skF_4')),
inference(splitLeft,[status(thm)],[c_118]) ).
tff(c_171,plain,
! [L_95,M_96] :
( ~ unequally_directed_lines(L_95,reverse_line(M_96))
| ~ unequally_directed_lines(L_95,M_96) ),
inference(negUnitSimplification,[status(thm)],[c_80,c_80,c_74]) ).
tff(c_174,plain,
~ unequally_directed_lines('#skF_3','#skF_4'),
inference(resolution,[status(thm)],[c_170,c_171]) ).
tff(c_182,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_154,c_174]) ).
tff(c_183,plain,
convergent_lines('#skF_1','#skF_2'),
inference(splitRight,[status(thm)],[c_118]) ).
tff(c_232,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_229,c_183]) ).
tff(c_233,plain,
convergent_lines('#skF_1','#skF_2'),
inference(splitRight,[status(thm)],[c_122]) ).
tff(c_287,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_285,c_233]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO228+1 : TPTP v8.1.2. Bugfixed v6.4.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.13/0.34 % Computer : n002.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri Aug 4 00:50:16 EDT 2023
% 0.13/0.34 % CPUTime :
% 3.73/1.87 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.73/1.87
% 3.73/1.87 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.84/1.90
% 3.84/1.90 Inference rules
% 3.84/1.90 ----------------------
% 3.84/1.90 #Ref : 0
% 3.84/1.90 #Sup : 22
% 3.84/1.90 #Fact : 0
% 3.84/1.90 #Define : 0
% 3.84/1.90 #Split : 5
% 3.84/1.90 #Chain : 0
% 3.84/1.90 #Close : 0
% 3.84/1.90
% 3.84/1.90 Ordering : KBO
% 3.84/1.90
% 3.84/1.90 Simplification rules
% 3.84/1.90 ----------------------
% 3.84/1.90 #Subsume : 52
% 3.84/1.90 #Demod : 2
% 3.84/1.90 #Tautology : 1
% 3.84/1.90 #SimpNegUnit : 17
% 3.84/1.90 #BackRed : 2
% 3.84/1.90
% 3.84/1.90 #Partial instantiations: 0
% 3.84/1.90 #Strategies tried : 1
% 3.84/1.90
% 3.84/1.90 Timing (in seconds)
% 3.84/1.90 ----------------------
% 3.84/1.90 Preprocessing : 0.57
% 3.84/1.90 Parsing : 0.30
% 3.84/1.90 CNF conversion : 0.05
% 3.84/1.90 Main loop : 0.29
% 3.84/1.90 Inferencing : 0.11
% 3.84/1.91 Reduction : 0.06
% 3.84/1.91 Demodulation : 0.03
% 3.84/1.91 BG Simplification : 0.03
% 3.84/1.91 Subsumption : 0.08
% 3.84/1.91 Abstraction : 0.01
% 3.84/1.91 MUC search : 0.00
% 3.84/1.91 Cooper : 0.00
% 3.84/1.91 Total : 0.91
% 3.84/1.91 Index Insertion : 0.00
% 3.84/1.91 Index Deletion : 0.00
% 3.84/1.91 Index Matching : 0.00
% 3.84/1.91 BG Taut test : 0.00
%------------------------------------------------------------------------------