TSTP Solution File: SWV390+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV390+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 : n010.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:03:59 EDT 2023
% Result : Theorem 6.30s 2.58s
% Output : CNFRefutation 6.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 37
% Syntax : Number of formulae : 50 ( 6 unt; 33 typ; 0 def)
% Number of atoms : 34 ( 4 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 30 ( 13 ~; 12 |; 1 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 48 ( 26 >; 22 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 24 ( 24 usr; 7 con; 0-3 aty)
% Number of variables : 57 (; 57 !; 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_1 > #skF_5 > #skF_6 > #skF_3 > #skF_2 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(bad,type,
bad: $i ).
tff(insert_cpq,type,
insert_cpq: ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $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('#skF_5',type,
'#skF_5': $i ).
tff(less_than,type,
less_than: ( $i * $i ) > $o ).
tff('#skF_6',type,
'#skF_6': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i * $i ) > $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_290,lemma,
! [U,V,W] :
( check_cpq(triple(U,V,W))
<=> ! [X,Y] :
( pair_in_list(V,X,Y)
=> less_than(Y,X) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l26_li4142) ).
tff(f_299,negated_conjecture,
~ ! [U,V,W] :
( ~ check_cpq(triple(U,V,W))
=> ! [X] : ~ check_cpq(insert_cpq(triple(U,V,W),X)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l26_co) ).
tff(f_224,axiom,
! [U,V,W,X] : ( insert_cpq(triple(U,V,W),X) = triple(insert_pqp(U,X),insert_slb(V,pair(X,bottom)),W) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax42) ).
tff(f_121,axiom,
! [U,V,W,X,Y] :
( pair_in_list(insert_slb(U,pair(V,X)),W,Y)
<=> ( pair_in_list(U,W,Y)
| ( ( V = W )
& ( X = Y ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax',ax23) ).
tff(c_106,plain,
! [V_119,U_118,W_120] :
( pair_in_list(V_119,'#skF_1'(U_118,V_119,W_120),'#skF_2'(U_118,V_119,W_120))
| check_cpq(triple(U_118,V_119,W_120)) ),
inference(cnfTransformation,[status(thm)],[f_290]) ).
tff(c_108,plain,
check_cpq(insert_cpq(triple('#skF_3','#skF_4','#skF_5'),'#skF_6')),
inference(cnfTransformation,[status(thm)],[f_299]) ).
tff(c_78,plain,
! [U_80,X_83,V_81,W_82] : ( triple(insert_pqp(U_80,X_83),insert_slb(V_81,pair(X_83,bottom)),W_82) = insert_cpq(triple(U_80,V_81,W_82),X_83) ),
inference(cnfTransformation,[status(thm)],[f_224]) ).
tff(c_36,plain,
! [V_21,U_20,Y_24,X_23,W_22] :
( ~ pair_in_list(U_20,W_22,Y_24)
| pair_in_list(insert_slb(U_20,pair(V_21,X_23)),W_22,Y_24) ),
inference(cnfTransformation,[status(thm)],[f_121]) ).
tff(c_470,plain,
! [V_224,U_225,Y_228,W_226,X_227] :
( less_than(Y_228,X_227)
| ~ pair_in_list(V_224,X_227,Y_228)
| ~ check_cpq(triple(U_225,V_224,W_226)) ),
inference(cnfTransformation,[status(thm)],[f_290]) ).
tff(c_2463,plain,
! [U_499,W_500,Y_502,X_503,U_505,W_504,V_501] :
( less_than(Y_502,W_504)
| ~ check_cpq(triple(U_505,insert_slb(U_499,pair(V_501,X_503)),W_500))
| ~ pair_in_list(U_499,W_504,Y_502) ),
inference(resolution,[status(thm)],[c_36,c_470]) ).
tff(c_2475,plain,
! [X_510,W_511,V_506,U_508,Y_509,W_507] :
( less_than(Y_509,W_511)
| ~ check_cpq(insert_cpq(triple(U_508,V_506,W_507),X_510))
| ~ pair_in_list(V_506,W_511,Y_509) ),
inference(superposition,[status(thm),theory(equality)],[c_78,c_2463]) ).
tff(c_2490,plain,
! [Y_512,W_513] :
( less_than(Y_512,W_513)
| ~ pair_in_list('#skF_4',W_513,Y_512) ),
inference(resolution,[status(thm)],[c_108,c_2475]) ).
tff(c_2496,plain,
! [U_514,W_515] :
( less_than('#skF_2'(U_514,'#skF_4',W_515),'#skF_1'(U_514,'#skF_4',W_515))
| check_cpq(triple(U_514,'#skF_4',W_515)) ),
inference(resolution,[status(thm)],[c_106,c_2490]) ).
tff(c_104,plain,
! [U_118,V_119,W_120] :
( ~ less_than('#skF_2'(U_118,V_119,W_120),'#skF_1'(U_118,V_119,W_120))
| check_cpq(triple(U_118,V_119,W_120)) ),
inference(cnfTransformation,[status(thm)],[f_290]) ).
tff(c_2510,plain,
! [U_514,W_515] : check_cpq(triple(U_514,'#skF_4',W_515)),
inference(resolution,[status(thm)],[c_2496,c_104]) ).
tff(c_110,plain,
~ check_cpq(triple('#skF_3','#skF_4','#skF_5')),
inference(cnfTransformation,[status(thm)],[f_299]) ).
tff(c_2516,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_2510,c_110]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SWV390+1 : TPTP v8.1.2. Released v3.3.0.
% 0.11/0.14 % 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 : n010.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 22:25:13 EDT 2023
% 0.13/0.36 % CPUTime :
% 6.30/2.58 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.30/2.58
% 6.30/2.58 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.30/2.61
% 6.30/2.61 Inference rules
% 6.30/2.61 ----------------------
% 6.30/2.61 #Ref : 0
% 6.30/2.61 #Sup : 522
% 6.30/2.61 #Fact : 60
% 6.30/2.61 #Define : 0
% 6.30/2.61 #Split : 0
% 6.30/2.61 #Chain : 0
% 6.30/2.61 #Close : 0
% 6.30/2.61
% 6.30/2.61 Ordering : KBO
% 6.30/2.61
% 6.30/2.61 Simplification rules
% 6.30/2.61 ----------------------
% 6.30/2.61 #Subsume : 127
% 6.30/2.61 #Demod : 128
% 6.30/2.61 #Tautology : 149
% 6.30/2.61 #SimpNegUnit : 12
% 6.30/2.61 #BackRed : 2
% 6.30/2.61
% 6.30/2.61 #Partial instantiations: 0
% 6.30/2.61 #Strategies tried : 1
% 6.30/2.61
% 6.30/2.61 Timing (in seconds)
% 6.30/2.61 ----------------------
% 6.30/2.61 Preprocessing : 0.64
% 6.30/2.61 Parsing : 0.32
% 6.30/2.61 CNF conversion : 0.04
% 6.30/2.61 Main loop : 0.81
% 6.30/2.61 Inferencing : 0.31
% 6.30/2.61 Reduction : 0.22
% 6.30/2.61 Demodulation : 0.16
% 6.30/2.61 BG Simplification : 0.04
% 6.30/2.61 Subsumption : 0.19
% 6.30/2.61 Abstraction : 0.04
% 6.30/2.61 MUC search : 0.00
% 6.30/2.61 Cooper : 0.00
% 6.30/2.61 Total : 1.49
% 6.30/2.61 Index Insertion : 0.00
% 6.30/2.61 Index Deletion : 0.00
% 6.30/2.61 Index Matching : 0.00
% 6.30/2.61 BG Taut test : 0.00
%------------------------------------------------------------------------------