TSTP Solution File: GEO085+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO085+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n020.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:08 EDT 2023
% Result : Theorem 3.69s 1.93s
% Output : CNFRefutation 3.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 28
% Syntax : Number of formulae : 52 ( 7 unt; 24 typ; 0 def)
% Number of atoms : 58 ( 15 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 57 ( 27 ~; 23 |; 3 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 45 ( 23 >; 22 *; 0 +; 0 <<)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 17 ( 17 usr; 1 con; 0-3 aty)
% Number of variables : 31 (; 26 !; 5 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ meet > part_of > inner_point > incident_c > end_point > open > closed > sum > #nlpp > #skF_9 > #skF_7 > #skF_11 > #skF_6 > #skF_8 > #skF_13 > #skF_16 > #skF_14 > #skF_12 > #skF_10 > #skF_2 > #skF_3 > #skF_1 > #skF_5 > #skF_15 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_9',type,
'#skF_9': $i > $i ).
tff('#skF_7',type,
'#skF_7': $i > $i ).
tff(closed,type,
closed: $i > $o ).
tff('#skF_11',type,
'#skF_11': ( $i * $i ) > $i ).
tff(inner_point,type,
inner_point: ( $i * $i ) > $o ).
tff(end_point,type,
end_point: ( $i * $i ) > $o ).
tff('#skF_6',type,
'#skF_6': ( $i * $i * $i ) > $i ).
tff('#skF_8',type,
'#skF_8': $i > $i ).
tff(part_of,type,
part_of: ( $i * $i ) > $o ).
tff('#skF_13',type,
'#skF_13': ( $i * $i ) > $i ).
tff('#skF_16',type,
'#skF_16': $i ).
tff('#skF_14',type,
'#skF_14': ( $i * $i ) > $i ).
tff('#skF_12',type,
'#skF_12': ( $i * $i ) > $i ).
tff(meet,type,
meet: ( $i * $i * $i ) > $o ).
tff(incident_c,type,
incident_c: ( $i * $i ) > $o ).
tff('#skF_10',type,
'#skF_10': ( $i * $i ) > $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i * $i ) > $i ).
tff(sum,type,
sum: ( $i * $i ) > $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i ) > $i ).
tff('#skF_15',type,
'#skF_15': ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i ) > $i ).
tff(open,type,
open: $i > $o ).
tff(f_215,negated_conjecture,
~ ! [C] :
( open(C)
=> ? [P,Q] :
( ( P != Q )
& end_point(P,C)
& end_point(Q,C) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',theorem_2_7_1) ).
tff(f_116,axiom,
! [C] :
( open(C)
<=> ? [P] : end_point(P,C) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004+0.ax',open_defn) ).
tff(f_111,axiom,
! [C] :
( closed(C)
<=> ~ ? [P] : end_point(P,C) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004+0.ax',closed_defn) ).
tff(f_178,axiom,
! [C,P] :
( end_point(P,C)
=> ? [Q] :
( end_point(Q,C)
& ( P != Q ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004+0.ax',c6) ).
tff(c_100,plain,
open('#skF_16'),
inference(cnfTransformation,[status(thm)],[f_215]) ).
tff(c_104,plain,
! [C_80] :
( end_point('#skF_8'(C_80),C_80)
| ~ open(C_80) ),
inference(cnfTransformation,[status(thm)],[f_116]) ).
tff(c_62,plain,
! [P_31,C_28] :
( ~ end_point(P_31,C_28)
| ~ closed(C_28) ),
inference(cnfTransformation,[status(thm)],[f_111]) ).
tff(c_122,plain,
! [C_82] :
( ~ closed(C_82)
| ~ open(C_82) ),
inference(resolution,[status(thm)],[c_104,c_62]) ).
tff(c_126,plain,
~ closed('#skF_16'),
inference(resolution,[status(thm)],[c_100,c_122]) ).
tff(c_66,plain,
! [C_32] :
( end_point('#skF_8'(C_32),C_32)
| ~ open(C_32) ),
inference(cnfTransformation,[status(thm)],[f_116]) ).
tff(c_64,plain,
! [C_28] :
( closed(C_28)
| end_point('#skF_7'(C_28),C_28) ),
inference(cnfTransformation,[status(thm)],[f_111]) ).
tff(c_132,plain,
! [Q_84,P_85] :
( ~ end_point(Q_84,'#skF_16')
| ~ end_point(P_85,'#skF_16')
| ( Q_84 = P_85 ) ),
inference(cnfTransformation,[status(thm)],[f_215]) ).
tff(c_135,plain,
! [P_85] :
( ~ end_point(P_85,'#skF_16')
| ( P_85 = '#skF_7'('#skF_16') )
| closed('#skF_16') ),
inference(resolution,[status(thm)],[c_64,c_132]) ).
tff(c_159,plain,
! [P_96] :
( ~ end_point(P_96,'#skF_16')
| ( P_96 = '#skF_7'('#skF_16') ) ),
inference(negUnitSimplification,[status(thm)],[c_126,c_135]) ).
tff(c_167,plain,
( ( '#skF_7'('#skF_16') = '#skF_8'('#skF_16') )
| ~ open('#skF_16') ),
inference(resolution,[status(thm)],[c_66,c_159]) ).
tff(c_174,plain,
'#skF_7'('#skF_16') = '#skF_8'('#skF_16'),
inference(demodulation,[status(thm),theory(equality)],[c_100,c_167]) ).
tff(c_179,plain,
( closed('#skF_16')
| end_point('#skF_8'('#skF_16'),'#skF_16') ),
inference(superposition,[status(thm),theory(equality)],[c_174,c_64]) ).
tff(c_182,plain,
end_point('#skF_8'('#skF_16'),'#skF_16'),
inference(negUnitSimplification,[status(thm)],[c_126,c_179]) ).
tff(c_219,plain,
! [C_104,P_105] :
( ( '#skF_12'(C_104,P_105) != P_105 )
| ~ end_point(P_105,C_104) ),
inference(cnfTransformation,[status(thm)],[f_178]) ).
tff(c_229,plain,
'#skF_12'('#skF_16','#skF_8'('#skF_16')) != '#skF_8'('#skF_16'),
inference(resolution,[status(thm)],[c_182,c_219]) ).
tff(c_232,plain,
! [C_106,P_107] :
( end_point('#skF_12'(C_106,P_107),C_106)
| ~ end_point(P_107,C_106) ),
inference(cnfTransformation,[status(thm)],[f_178]) ).
tff(c_98,plain,
! [Q_74,P_73] :
( ~ end_point(Q_74,'#skF_16')
| ~ end_point(P_73,'#skF_16')
| ( Q_74 = P_73 ) ),
inference(cnfTransformation,[status(thm)],[f_215]) ).
tff(c_266,plain,
! [P_113,P_114] :
( ~ end_point(P_113,'#skF_16')
| ( P_113 = '#skF_12'('#skF_16',P_114) )
| ~ end_point(P_114,'#skF_16') ),
inference(resolution,[status(thm)],[c_232,c_98]) ).
tff(c_274,plain,
! [P_114] :
( ( '#skF_7'('#skF_16') = '#skF_12'('#skF_16',P_114) )
| ~ end_point(P_114,'#skF_16')
| closed('#skF_16') ),
inference(resolution,[status(thm)],[c_64,c_266]) ).
tff(c_281,plain,
! [P_114] :
( ( '#skF_8'('#skF_16') = '#skF_12'('#skF_16',P_114) )
| ~ end_point(P_114,'#skF_16')
| closed('#skF_16') ),
inference(demodulation,[status(thm),theory(equality)],[c_174,c_274]) ).
tff(c_332,plain,
! [P_130] :
( ( '#skF_8'('#skF_16') = '#skF_12'('#skF_16',P_130) )
| ~ end_point(P_130,'#skF_16') ),
inference(negUnitSimplification,[status(thm)],[c_126,c_281]) ).
tff(c_339,plain,
'#skF_12'('#skF_16','#skF_8'('#skF_16')) = '#skF_8'('#skF_16'),
inference(resolution,[status(thm)],[c_182,c_332]) ).
tff(c_352,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_229,c_339]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : GEO085+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.15 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.15/0.36 % Computer : n020.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri Aug 4 00:37:22 EDT 2023
% 0.15/0.36 % CPUTime :
% 3.69/1.93 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.69/1.94
% 3.69/1.94 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.69/1.97
% 3.69/1.97 Inference rules
% 3.69/1.97 ----------------------
% 3.69/1.97 #Ref : 0
% 3.69/1.97 #Sup : 49
% 3.69/1.97 #Fact : 0
% 3.69/1.97 #Define : 0
% 3.69/1.97 #Split : 0
% 3.69/1.97 #Chain : 0
% 3.69/1.97 #Close : 0
% 3.69/1.97
% 3.69/1.97 Ordering : KBO
% 3.69/1.97
% 3.69/1.97 Simplification rules
% 3.69/1.97 ----------------------
% 3.69/1.97 #Subsume : 6
% 3.69/1.97 #Demod : 9
% 3.69/1.97 #Tautology : 11
% 3.69/1.97 #SimpNegUnit : 7
% 3.69/1.97 #BackRed : 1
% 3.69/1.97
% 3.69/1.97 #Partial instantiations: 0
% 3.69/1.97 #Strategies tried : 1
% 3.69/1.97
% 3.69/1.97 Timing (in seconds)
% 3.69/1.97 ----------------------
% 3.69/1.97 Preprocessing : 0.59
% 3.69/1.97 Parsing : 0.28
% 3.69/1.97 CNF conversion : 0.05
% 3.69/1.97 Main loop : 0.31
% 3.69/1.97 Inferencing : 0.11
% 3.69/1.97 Reduction : 0.08
% 3.69/1.97 Demodulation : 0.06
% 3.69/1.97 BG Simplification : 0.03
% 3.69/1.97 Subsumption : 0.07
% 3.69/1.97 Abstraction : 0.02
% 3.69/1.97 MUC search : 0.00
% 3.69/1.97 Cooper : 0.00
% 3.69/1.97 Total : 0.94
% 3.69/1.97 Index Insertion : 0.00
% 3.69/1.97 Index Deletion : 0.00
% 3.69/1.97 Index Matching : 0.00
% 3.69/1.97 BG Taut test : 0.00
%------------------------------------------------------------------------------