TSTP Solution File: SWV397+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV397+1 : TPTP v8.1.2. Released v3.3.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 : n004.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:04:00 EDT 2023
% Result : Theorem 4.32s 2.01s
% Output : CNFRefutation 4.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 34
% Syntax : Number of formulae : 40 ( 4 unt; 31 typ; 0 def)
% Number of atoms : 14 ( 2 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 9 ( 4 ~; 2 |; 0 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 42 ( 24 >; 18 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 22 ( 22 usr; 7 con; 0-3 aty)
% Number of variables : 16 (; 16 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ pair_in_list > succ_cpq > strictly_less_than > less_than > contains_slb > contains_cpq > ok > isnonempty_slb > check_cpq > triple > update_slb > remove_slb > remove_pqp > remove_cpq > pair > lookup_slb > insert_slb > insert_pqp > insert_cpq > #nlpp > removemin_cpq_res > removemin_cpq_eff > findmin_pqp_res > findmin_cpq_res > findmin_cpq_eff > create_slb > bottom > bad > #skF_2 > #skF_3 > #skF_1 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(bad,type,
bad: $i ).
tff(insert_cpq,type,
insert_cpq: ( $i * $i ) > $i ).
tff(succ_cpq,type,
succ_cpq: ( $i * $i ) > $o ).
tff(remove_cpq,type,
remove_cpq: ( $i * $i ) > $i ).
tff(contains_slb,type,
contains_slb: ( $i * $i ) > $o ).
tff(lookup_slb,type,
lookup_slb: ( $i * $i ) > $i ).
tff(pair_in_list,type,
pair_in_list: ( $i * $i * $i ) > $o ).
tff(less_than,type,
less_than: ( $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(contains_cpq,type,
contains_cpq: ( $i * $i ) > $o ).
tff(strictly_less_than,type,
strictly_less_than: ( $i * $i ) > $o ).
tff(pair,type,
pair: ( $i * $i ) > $i ).
tff(ok,type,
ok: $i > $o ).
tff(insert_pqp,type,
insert_pqp: ( $i * $i ) > $i ).
tff(findmin_pqp_res,type,
findmin_pqp_res: $i > $i ).
tff(remove_pqp,type,
remove_pqp: ( $i * $i ) > $i ).
tff(bottom,type,
bottom: $i ).
tff(triple,type,
triple: ( $i * $i * $i ) > $i ).
tff(removemin_cpq_res,type,
removemin_cpq_res: $i > $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(isnonempty_slb,type,
isnonempty_slb: $i > $o ).
tff(check_cpq,type,
check_cpq: $i > $o ).
tff(remove_slb,type,
remove_slb: ( $i * $i ) > $i ).
tff(findmin_cpq_eff,type,
findmin_cpq_eff: $i > $i ).
tff(removemin_cpq_eff,type,
removemin_cpq_eff: $i > $i ).
tff(create_slb,type,
create_slb: $i ).
tff(findmin_cpq_res,type,
findmin_cpq_res: $i > $i ).
tff(insert_slb,type,
insert_slb: ( $i * $i ) > $i ).
tff(update_slb,type,
update_slb: ( $i * $i ) > $i ).
tff(f_288,negated_conjecture,
~ ! [U,V,W,X] :
( ok(remove_cpq(triple(U,V,W),X))
=> contains_slb(V,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l33_co) ).
tff(f_217,axiom,
! [U,V] :
( ok(triple(U,V,bad))
<=> $false ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax40) ).
tff(f_229,axiom,
! [U,V,W,X] :
( ~ contains_slb(V,X)
=> ( remove_cpq(triple(U,V,W),X) = triple(U,V,bad) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax43) ).
tff(c_102,plain,
~ contains_slb('#skF_2','#skF_4'),
inference(cnfTransformation,[status(thm)],[f_288]) ).
tff(c_74,plain,
! [U_75,V_76] : ~ ok(triple(U_75,V_76,bad)),
inference(cnfTransformation,[status(thm)],[f_217]) ).
tff(c_485,plain,
! [U_223,V_224,W_225,X_226] :
( ( remove_cpq(triple(U_223,V_224,W_225),X_226) = triple(U_223,V_224,bad) )
| contains_slb(V_224,X_226) ),
inference(cnfTransformation,[status(thm)],[f_229]) ).
tff(c_104,plain,
ok(remove_cpq(triple('#skF_1','#skF_2','#skF_3'),'#skF_4')),
inference(cnfTransformation,[status(thm)],[f_288]) ).
tff(c_498,plain,
( ok(triple('#skF_1','#skF_2',bad))
| contains_slb('#skF_2','#skF_4') ),
inference(superposition,[status(thm),theory(equality)],[c_485,c_104]) ).
tff(c_508,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_102,c_74,c_498]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV397+1 : TPTP v8.1.2. Released v3.3.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 : n004.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 : Thu Aug 3 22:57:41 EDT 2023
% 0.13/0.34 % CPUTime :
% 4.32/2.01 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.32/2.01
% 4.32/2.01 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.32/2.04
% 4.32/2.04 Inference rules
% 4.32/2.04 ----------------------
% 4.32/2.04 #Ref : 0
% 4.32/2.04 #Sup : 81
% 4.32/2.04 #Fact : 8
% 4.32/2.04 #Define : 0
% 4.32/2.04 #Split : 0
% 4.32/2.04 #Chain : 0
% 4.32/2.04 #Close : 0
% 4.32/2.04
% 4.32/2.04 Ordering : KBO
% 4.32/2.04
% 4.32/2.04 Simplification rules
% 4.32/2.04 ----------------------
% 4.32/2.04 #Subsume : 19
% 4.32/2.04 #Demod : 22
% 4.32/2.04 #Tautology : 44
% 4.32/2.04 #SimpNegUnit : 2
% 4.32/2.04 #BackRed : 0
% 4.32/2.04
% 4.32/2.04 #Partial instantiations: 0
% 4.32/2.04 #Strategies tried : 1
% 4.32/2.04
% 4.32/2.04 Timing (in seconds)
% 4.32/2.04 ----------------------
% 4.32/2.04 Preprocessing : 0.62
% 4.32/2.04 Parsing : 0.32
% 4.32/2.04 CNF conversion : 0.04
% 4.32/2.04 Main loop : 0.37
% 4.32/2.04 Inferencing : 0.13
% 4.32/2.04 Reduction : 0.12
% 4.32/2.04 Demodulation : 0.09
% 4.32/2.04 BG Simplification : 0.03
% 4.32/2.04 Subsumption : 0.08
% 4.32/2.04 Abstraction : 0.02
% 4.32/2.04 MUC search : 0.00
% 4.32/2.04 Cooper : 0.00
% 4.32/2.04 Total : 1.04
% 4.32/2.04 Index Insertion : 0.00
% 4.32/2.04 Index Deletion : 0.00
% 4.32/2.04 Index Matching : 0.00
% 4.32/2.04 BG Taut test : 0.00
%------------------------------------------------------------------------------