TSTP Solution File: GEO086+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO086+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/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:09 EDT 2023
% Result : Theorem 3.44s 1.94s
% Output : CNFRefutation 3.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 29
% Syntax : Number of formulae : 45 ( 8 unt; 25 typ; 0 def)
% Number of atoms : 35 ( 4 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 27 ( 12 ~; 9 |; 2 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 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 : 18 ( 18 usr; 2 con; 0-3 aty)
% Number of variables : 18 (; 16 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ meet > part_of > inner_point > incident_c > end_point > open > closed > sum > #nlpp > #skF_9 > #skF_7 > #skF_11 > #skF_17 > #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_17',type,
'#skF_17': $i ).
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_211,negated_conjecture,
~ ! [C,Cpp] :
( ( open(C)
& part_of(Cpp,C) )
=> open(Cpp) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',theorem_2_7_2) ).
tff(f_116,axiom,
! [C] :
( open(C)
<=> ? [P] : end_point(P,C) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004+0.ax',open_defn) ).
tff(f_111,axiom,
! [C] :
( closed(C)
<=> ~ ? [P] : end_point(P,C) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004+0.ax',closed_defn) ).
tff(f_123,axiom,
! [C,C1] :
( ( part_of(C1,C)
& ( C1 != C ) )
=> open(C1) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004+0.ax',c1) ).
tff(c_102,plain,
open('#skF_16'),
inference(cnfTransformation,[status(thm)],[f_211]) ).
tff(c_132,plain,
! [C_84] :
( end_point('#skF_8'(C_84),C_84)
| ~ open(C_84) ),
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_141,plain,
! [C_85] :
( ~ closed(C_85)
| ~ open(C_85) ),
inference(resolution,[status(thm)],[c_132,c_62]) ).
tff(c_149,plain,
~ closed('#skF_16'),
inference(resolution,[status(thm)],[c_102,c_141]) ).
tff(c_98,plain,
~ open('#skF_17'),
inference(cnfTransformation,[status(thm)],[f_211]) ).
tff(c_100,plain,
part_of('#skF_17','#skF_16'),
inference(cnfTransformation,[status(thm)],[f_211]) ).
tff(c_152,plain,
! [C1_91,C_92] :
( open(C1_91)
| ( C_92 = C1_91 )
| ~ part_of(C1_91,C_92) ),
inference(cnfTransformation,[status(thm)],[f_123]) ).
tff(c_155,plain,
( open('#skF_17')
| ( '#skF_17' = '#skF_16' ) ),
inference(resolution,[status(thm)],[c_100,c_152]) ).
tff(c_158,plain,
'#skF_17' = '#skF_16',
inference(negUnitSimplification,[status(thm)],[c_98,c_155]) ).
tff(c_117,plain,
! [C_81] :
( closed(C_81)
| end_point('#skF_7'(C_81),C_81) ),
inference(cnfTransformation,[status(thm)],[f_111]) ).
tff(c_68,plain,
! [C_32,P_35] :
( open(C_32)
| ~ end_point(P_35,C_32) ),
inference(cnfTransformation,[status(thm)],[f_116]) ).
tff(c_127,plain,
! [C_83] :
( open(C_83)
| closed(C_83) ),
inference(resolution,[status(thm)],[c_117,c_68]) ).
tff(c_131,plain,
closed('#skF_17'),
inference(resolution,[status(thm)],[c_127,c_98]) ).
tff(c_159,plain,
closed('#skF_16'),
inference(demodulation,[status(thm),theory(equality)],[c_158,c_131]) ).
tff(c_163,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_149,c_159]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : GEO086+1 : TPTP v8.1.2. Released v2.4.0.
% 0.13/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 01:07:15 EDT 2023
% 0.14/0.37 % CPUTime :
% 3.44/1.94 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.44/1.94
% 3.44/1.94 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.65/1.96
% 3.65/1.96 Inference rules
% 3.65/1.96 ----------------------
% 3.65/1.97 #Ref : 0
% 3.65/1.97 #Sup : 10
% 3.65/1.97 #Fact : 0
% 3.65/1.97 #Define : 0
% 3.65/1.97 #Split : 0
% 3.65/1.97 #Chain : 0
% 3.65/1.97 #Close : 0
% 3.65/1.97
% 3.65/1.97 Ordering : KBO
% 3.65/1.97
% 3.65/1.97 Simplification rules
% 3.65/1.97 ----------------------
% 3.65/1.97 #Subsume : 0
% 3.65/1.97 #Demod : 3
% 3.65/1.97 #Tautology : 3
% 3.65/1.97 #SimpNegUnit : 2
% 3.65/1.97 #BackRed : 3
% 3.65/1.97
% 3.65/1.97 #Partial instantiations: 0
% 3.65/1.97 #Strategies tried : 1
% 3.65/1.97
% 3.65/1.97 Timing (in seconds)
% 3.65/1.97 ----------------------
% 3.65/1.97 Preprocessing : 0.59
% 3.65/1.97 Parsing : 0.30
% 3.65/1.97 CNF conversion : 0.05
% 3.65/1.97 Main loop : 0.22
% 3.65/1.97 Inferencing : 0.06
% 3.65/1.97 Reduction : 0.07
% 3.65/1.97 Demodulation : 0.05
% 3.65/1.97 BG Simplification : 0.03
% 3.65/1.97 Subsumption : 0.05
% 3.65/1.97 Abstraction : 0.01
% 3.65/1.97 MUC search : 0.00
% 3.65/1.97 Cooper : 0.00
% 3.65/1.97 Total : 0.86
% 3.65/1.97 Index Insertion : 0.00
% 3.65/1.97 Index Deletion : 0.00
% 3.65/1.97 Index Matching : 0.00
% 3.65/1.97 BG Taut test : 0.00
%------------------------------------------------------------------------------