TSTP Solution File: GEO080+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO080+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 : 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:07 EDT 2023
% Result : Theorem 3.31s 1.75s
% Output : CNFRefutation 3.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 26
% Syntax : Number of formulae : 31 ( 4 unt; 24 typ; 0 def)
% Number of atoms : 11 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 7 ( 3 ~; 2 |; 0 &)
% ( 1 <=>; 1 =>; 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 : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 17 ( 17 usr; 1 con; 0-3 aty)
% Number of variables : 9 (; 9 !; 0 ?; 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_57,axiom,
! [C,C1] :
( part_of(C1,C)
<=> ! [P] :
( incident_c(P,C1)
=> incident_c(P,C) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO004+0.ax',part_of_defn) ).
tff(f_207,negated_conjecture,
~ ! [C] : part_of(C,C),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_reflexivity) ).
tff(c_157,plain,
! [C_100,C1_101] :
( incident_c('#skF_1'(C_100,C1_101),C1_101)
| part_of(C1_101,C_100) ),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_4,plain,
! [C_1,C1_2] :
( ~ incident_c('#skF_1'(C_1,C1_2),C_1)
| part_of(C1_2,C_1) ),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_162,plain,
! [C1_101] : part_of(C1_101,C1_101),
inference(resolution,[status(thm)],[c_157,c_4]) ).
tff(c_98,plain,
~ part_of('#skF_16','#skF_16'),
inference(cnfTransformation,[status(thm)],[f_207]) ).
tff(c_171,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_162,c_98]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GEO080+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.14 % 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.14/0.35 % Computer : n002.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:54:46 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.31/1.75 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.31/1.76
% 3.31/1.76 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.31/1.77
% 3.31/1.77 Inference rules
% 3.31/1.77 ----------------------
% 3.31/1.77 #Ref : 0
% 3.31/1.78 #Sup : 12
% 3.31/1.78 #Fact : 0
% 3.31/1.78 #Define : 0
% 3.31/1.78 #Split : 0
% 3.31/1.78 #Chain : 0
% 3.31/1.78 #Close : 0
% 3.31/1.78
% 3.31/1.78 Ordering : KBO
% 3.31/1.78
% 3.31/1.78 Simplification rules
% 3.31/1.78 ----------------------
% 3.31/1.78 #Subsume : 0
% 3.31/1.78 #Demod : 1
% 3.31/1.78 #Tautology : 3
% 3.31/1.78 #SimpNegUnit : 0
% 3.31/1.78 #BackRed : 1
% 3.31/1.78
% 3.31/1.78 #Partial instantiations: 0
% 3.31/1.78 #Strategies tried : 1
% 3.31/1.78
% 3.31/1.78 Timing (in seconds)
% 3.31/1.78 ----------------------
% 3.31/1.78 Preprocessing : 0.54
% 3.31/1.78 Parsing : 0.26
% 3.31/1.78 CNF conversion : 0.05
% 3.31/1.78 Main loop : 0.21
% 3.31/1.78 Inferencing : 0.06
% 3.31/1.78 Reduction : 0.06
% 3.31/1.78 Demodulation : 0.04
% 3.31/1.78 BG Simplification : 0.03
% 3.31/1.78 Subsumption : 0.05
% 3.31/1.78 Abstraction : 0.01
% 3.31/1.78 MUC search : 0.00
% 3.31/1.78 Cooper : 0.00
% 3.31/1.78 Total : 0.79
% 3.31/1.78 Index Insertion : 0.00
% 3.31/1.78 Index Deletion : 0.00
% 3.31/1.78 Index Matching : 0.00
% 3.31/1.78 BG Taut test : 0.00
%------------------------------------------------------------------------------