TSTP Solution File: SWW592_2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWW592_2 : TPTP v8.1.2. Released v6.1.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 : n026.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 11:07:45 EDT 2023
% Result : Theorem 3.90s 1.90s
% Output : CNFRefutation 3.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 29
% Syntax : Number of formulae : 34 ( 6 unt; 27 typ; 0 def)
% Number of atoms : 9 ( 7 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 5 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 42 ( 1 atm; 1 fun; 39 num; 1 var)
% Number of types : 7 ( 5 usr; 1 ari)
% Number of type conns : 21 ( 12 >; 9 *; 0 +; 0 <<)
% Number of predicates : 4 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 24 ( 21 usr; 12 con; 0-4 aty)
% Number of variables : 3 (; 3 !; 0 ?; 3 :)
% Comments :
%------------------------------------------------------------------------------
%$ sort1 > mk_t1 > match_bool1 > power1 > mult1 > #nlpp > witness1 > fib1 > abs1 > a221 > a211 > a121 > a111 > tuple03 > tuple0 > true1 > t > real > qtmark > int > false1 > bool
%Foreground sorts:
tff(tuple02,type,
tuple02: $tType ).
tff(t1,type,
t1: $tType ).
tff(bool1,type,
bool1: $tType ).
tff(ty,type,
ty: $tType ).
tff(uni,type,
uni: $tType ).
%Background operators:
tff('#skF_1',type,
'#skF_1': $int ).
%Foreground operators:
tff(a221,type,
a221: t1 > $int ).
tff(a111,type,
a111: t1 > $int ).
tff(true1,type,
true1: bool1 ).
tff(mk_t1,type,
mk_t1: ( $int * $int * $int * $int ) > t1 ).
tff(int,type,
int: ty ).
tff(false1,type,
false1: bool1 ).
tff(sort1,type,
sort1: ( ty * uni ) > $o ).
tff(witness1,type,
witness1: ty > uni ).
tff(real,type,
real: ty ).
tff(power1,type,
power1: ( t1 * $int ) > t1 ).
tff(a121,type,
a121: t1 > $int ).
tff(match_bool1,type,
match_bool1: ( ty * bool1 * uni * uni ) > uni ).
tff(mult1,type,
mult1: ( t1 * t1 ) > t1 ).
tff(tuple0,type,
tuple0: ty ).
tff(qtmark,type,
qtmark: ty ).
tff(bool,type,
bool: ty ).
tff(a211,type,
a211: t1 > $int ).
tff(tuple03,type,
tuple03: tuple02 ).
tff(t,type,
t: ty ).
tff(fib1,type,
fib1: $int > $int ).
tff(abs1,type,
abs1: $int > $int ).
tff(f_107,axiom,
! [X: t1] : ( power1(X,0) = mk_t1(1,0,0,1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',power_0) ).
tff(f_140,negated_conjecture,
~ ! [Na: $int] :
( $lesseq(0,Na)
=> ( ( Na = 0 )
=> ( power1(mk_t1(1,1,1,0),Na) = mk_t1($sum(1,0),0,0,1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wP_parameter_logfib) ).
tff(c_120,plain,
! [X_54: t1] : ( power1(X_54,0) = mk_t1(1,0,0,1) ),
inference(cnfTransformation,[status(thm)],[f_107]) ).
tff(c_100,plain,
'#skF_1' = 0,
inference(cnfTransformation,[status(thm)],[f_140]) ).
tff(c_104,plain,
power1(mk_t1(1,1,1,0),'#skF_1') != mk_t1(1,0,0,1),
inference(cnfTransformation,[status(thm)],[f_140]) ).
tff(c_162,plain,
power1(mk_t1(1,1,1,0),0) != mk_t1(1,0,0,1),
inference(demodulation,[status(thm),theory(equality)],[c_100,c_104]) ).
tff(c_170,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_120,c_162]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWW592_2 : TPTP v8.1.2. Released v6.1.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.35 % Computer : n026.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 19:32:01 EDT 2023
% 0.13/0.35 % CPUTime :
% 3.90/1.90 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.90/1.90
% 3.90/1.90 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.95/1.93
% 3.95/1.93 Inference rules
% 3.95/1.93 ----------------------
% 3.95/1.93 #Ref : 0
% 3.95/1.93 #Sup : 0
% 3.95/1.93 #Fact : 0
% 3.95/1.93 #Define : 0
% 3.95/1.93 #Split : 0
% 3.95/1.93 #Chain : 0
% 3.95/1.93 #Close : 0
% 3.95/1.93
% 3.95/1.93 Ordering : LPO
% 3.95/1.93
% 3.95/1.93 Simplification rules
% 3.95/1.93 ----------------------
% 3.95/1.93 #Subsume : 37
% 3.95/1.93 #Demod : 3
% 3.95/1.93 #Tautology : 1
% 3.95/1.93 #SimpNegUnit : 0
% 3.95/1.93 #BackRed : 0
% 3.95/1.93
% 3.95/1.93 #Partial instantiations: 0
% 3.95/1.93 #Strategies tried : 1
% 3.95/1.93
% 3.95/1.93 Timing (in seconds)
% 3.95/1.93 ----------------------
% 3.95/1.93 Preprocessing : 0.73
% 3.95/1.93 Parsing : 0.38
% 3.95/1.93 CNF conversion : 0.04
% 3.95/1.93 Main loop : 0.07
% 3.95/1.93 Inferencing : 0.00
% 3.95/1.93 Reduction : 0.03
% 3.95/1.93 Demodulation : 0.02
% 3.95/1.93 BG Simplification : 0.07
% 3.95/1.93 Subsumption : 0.03
% 3.95/1.93 Abstraction : 0.01
% 3.95/1.93 MUC search : 0.00
% 3.95/1.93 Cooper : 0.00
% 3.95/1.93 Total : 0.84
% 3.95/1.93 Index Insertion : 0.00
% 3.95/1.93 Index Deletion : 0.00
% 3.95/1.93 Index Matching : 0.00
% 3.95/1.93 BG Taut test : 0.00
%------------------------------------------------------------------------------