TSTP Solution File: SWV372+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV372+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/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 : n024.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:56 EDT 2023
% Result : Theorem 7.50s 2.72s
% Output : CNFRefutation 7.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 62
% Syntax : Number of formulae : 90 ( 22 unt; 52 typ; 0 def)
% Number of atoms : 59 ( 20 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 40 ( 19 ~; 13 |; 1 &)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 76 ( 45 >; 31 *; 0 +; 0 <<)
% Number of predicates : 21 ( 19 usr; 1 prp; 0-3 aty)
% Number of functors : 33 ( 33 usr; 7 con; 0-3 aty)
% Number of variables : 63 (; 63 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ pair_in_list > succ_cpq > strictly_less_than > pi_sharp_removemin > pi_sharp_remove > pi_sharp_find_min > pi_remove > less_than > issmallestelement_pq > contains_slb > contains_pq > contains_cpq > pi_removemin > pi_find_min > phi > ok > isnonempty_slb > isnonempty_pq > check_cpq > triple > update_slb > removemin_pq_res > removemin_pq_eff > remove_slb > remove_pqp > remove_pq > remove_cpq > pair > lookup_slb > insert_slb > insert_pqp > insert_pq > insert_cpq > findmin_pq_res > findmin_pq_eff > #nlpp > removemin_cpq_res > removemin_cpq_eff > i > findmin_pqp_res > findmin_cpq_res > findmin_cpq_eff > create_slb > create_pq > bottom > bad > #skF_2 > #skF_4 > #skF_7 > #skF_5 > #skF_6 > #skF_3 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(bad,type,
bad: $i ).
tff(insert_cpq,type,
insert_cpq: ( $i * $i ) > $i ).
tff(pi_sharp_find_min,type,
pi_sharp_find_min: ( $i * $i ) > $o ).
tff(pi_remove,type,
pi_remove: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': $i > $i ).
tff('#skF_4',type,
'#skF_4': $i > $i ).
tff(succ_cpq,type,
succ_cpq: ( $i * $i ) > $o ).
tff(insert_pq,type,
insert_pq: ( $i * $i ) > $i ).
tff(pi_find_min,type,
pi_find_min: $i > $o ).
tff(i,type,
i: $i > $i ).
tff(remove_cpq,type,
remove_cpq: ( $i * $i ) > $i ).
tff(pi_sharp_removemin,type,
pi_sharp_removemin: ( $i * $i ) > $o ).
tff(pi_sharp_remove,type,
pi_sharp_remove: ( $i * $i ) > $o ).
tff(contains_slb,type,
contains_slb: ( $i * $i ) > $o ).
tff(contains_pq,type,
contains_pq: ( $i * $i ) > $o ).
tff(findmin_pq_eff,type,
findmin_pq_eff: ( $i * $i ) > $i ).
tff(lookup_slb,type,
lookup_slb: ( $i * $i ) > $i ).
tff(pi_removemin,type,
pi_removemin: $i > $o ).
tff('#skF_7',type,
'#skF_7': $i ).
tff(phi,type,
phi: $i > $o ).
tff(pair_in_list,type,
pair_in_list: ( $i * $i * $i ) > $o ).
tff(isnonempty_pq,type,
isnonempty_pq: $i > $o ).
tff(findmin_pq_res,type,
findmin_pq_res: ( $i * $i ) > $i ).
tff('#skF_5',type,
'#skF_5': $i ).
tff(less_than,type,
less_than: ( $i * $i ) > $o ).
tff('#skF_6',type,
'#skF_6': $i ).
tff(issmallestelement_pq,type,
issmallestelement_pq: ( $i * $i ) > $o ).
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(remove_pq,type,
remove_pq: ( $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(removemin_pq_res,type,
removemin_pq_res: ( $i * $i ) > $i ).
tff(triple,type,
triple: ( $i * $i * $i ) > $i ).
tff(create_pq,type,
create_pq: $i ).
tff(removemin_cpq_res,type,
removemin_cpq_res: $i > $i ).
tff('#skF_3',type,
'#skF_3': $i > $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(removemin_pq_eff,type,
removemin_pq_eff: ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $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_104,axiom,
! [U] : ~ contains_pq(create_pq,U),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+1.ax',ax8) ).
tff(f_298,axiom,
! [U,V] :
( ok(triple(U,V,bad))
<=> $false ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax40) ).
tff(f_295,axiom,
! [U,V,W,X] :
( contains_cpq(triple(U,V,W),X)
<=> contains_slb(V,X) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax39) ).
tff(f_438,lemma,
! [U,V,W,X] :
( contains_cpq(triple(U,V,W),X)
<=> contains_pq(i(triple(U,V,W)),X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l8_li56) ).
tff(f_357,axiom,
! [U,V,W,X] :
( ( V != create_slb )
=> ( findmin_cpq_res(triple(U,V,W)) = findmin_pqp_res(U) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax51) ).
tff(f_458,negated_conjecture,
~ ! [U,V,W] :
( phi(findmin_cpq_eff(triple(U,V,W)))
=> contains_pq(i(triple(U,V,W)),findmin_cpq_res(triple(U,V,W))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l8_co) ).
tff(f_332,axiom,
! [U,V,W,X] :
( ( ( V != create_slb )
& ~ contains_slb(V,findmin_pqp_res(U)) )
=> ( findmin_cpq_eff(triple(U,V,W)) = triple(U,update_slb(V,findmin_pqp_res(U)),bad) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax47) ).
tff(f_452,lemma,
! [U,V,W] :
( ~ ok(triple(U,V,W))
=> ~ phi(triple(U,V,W)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l8_lX) ).
tff(f_324,axiom,
! [U,V] : ( findmin_cpq_eff(triple(U,create_slb,V)) = triple(U,create_slb,bad) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax46) ).
tff(f_389,axiom,
! [U,V] : ( i(triple(U,create_slb,V)) = create_pq ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+4.ax',ax54) ).
tff(c_20,plain,
! [U_12] : ~ contains_pq(create_pq,U_12),
inference(cnfTransformation,[status(thm)],[f_104]) ).
tff(c_106,plain,
! [U_102,V_103] : ~ ok(triple(U_102,V_103,bad)),
inference(cnfTransformation,[status(thm)],[f_298]) ).
tff(c_104,plain,
! [U_98,V_99,W_100,X_101] :
( contains_cpq(triple(U_98,V_99,W_100),X_101)
| ~ contains_slb(V_99,X_101) ),
inference(cnfTransformation,[status(thm)],[f_295]) ).
tff(c_1531,plain,
! [U_419,V_420,W_421,X_422] :
( contains_pq(i(triple(U_419,V_420,W_421)),X_422)
| ~ contains_cpq(triple(U_419,V_420,W_421),X_422) ),
inference(cnfTransformation,[status(thm)],[f_438]) ).
tff(c_623,plain,
! [U_320,V_321,W_322] :
( ( findmin_cpq_res(triple(U_320,V_321,W_322)) = findmin_pqp_res(U_320) )
| ( create_slb = V_321 ) ),
inference(cnfTransformation,[status(thm)],[f_357]) ).
tff(c_182,plain,
~ contains_pq(i(triple('#skF_5','#skF_6','#skF_7')),findmin_cpq_res(triple('#skF_5','#skF_6','#skF_7'))),
inference(cnfTransformation,[status(thm)],[f_458]) ).
tff(c_639,plain,
( ~ contains_pq(i(triple('#skF_5','#skF_6','#skF_7')),findmin_pqp_res('#skF_5'))
| ( create_slb = '#skF_6' ) ),
inference(superposition,[status(thm),theory(equality)],[c_623,c_182]) ).
tff(c_784,plain,
~ contains_pq(i(triple('#skF_5','#skF_6','#skF_7')),findmin_pqp_res('#skF_5')),
inference(splitLeft,[status(thm)],[c_639]) ).
tff(c_1576,plain,
~ contains_cpq(triple('#skF_5','#skF_6','#skF_7'),findmin_pqp_res('#skF_5')),
inference(resolution,[status(thm)],[c_1531,c_784]) ).
tff(c_1590,plain,
~ contains_slb('#skF_6',findmin_pqp_res('#skF_5')),
inference(resolution,[status(thm)],[c_104,c_1576]) ).
tff(c_184,plain,
phi(findmin_cpq_eff(triple('#skF_5','#skF_6','#skF_7'))),
inference(cnfTransformation,[status(thm)],[f_458]) ).
tff(c_2711,plain,
! [U_580,V_581,W_582] :
( ( triple(U_580,update_slb(V_581,findmin_pqp_res(U_580)),bad) = findmin_cpq_eff(triple(U_580,V_581,W_582)) )
| contains_slb(V_581,findmin_pqp_res(U_580))
| ( create_slb = V_581 ) ),
inference(cnfTransformation,[status(thm)],[f_332]) ).
tff(c_180,plain,
! [U_179,V_180,W_181] :
( ~ phi(triple(U_179,V_180,W_181))
| ok(triple(U_179,V_180,W_181)) ),
inference(cnfTransformation,[status(thm)],[f_452]) ).
tff(c_2763,plain,
! [U_580,V_581,W_582] :
( ~ phi(findmin_cpq_eff(triple(U_580,V_581,W_582)))
| ok(triple(U_580,update_slb(V_581,findmin_pqp_res(U_580)),bad))
| contains_slb(V_581,findmin_pqp_res(U_580))
| ( create_slb = V_581 ) ),
inference(superposition,[status(thm),theory(equality)],[c_2711,c_180]) ).
tff(c_2828,plain,
! [U_583,V_584,W_585] :
( ~ phi(findmin_cpq_eff(triple(U_583,V_584,W_585)))
| contains_slb(V_584,findmin_pqp_res(U_583))
| ( create_slb = V_584 ) ),
inference(negUnitSimplification,[status(thm)],[c_106,c_2763]) ).
tff(c_2846,plain,
( contains_slb('#skF_6',findmin_pqp_res('#skF_5'))
| ( create_slb = '#skF_6' ) ),
inference(resolution,[status(thm)],[c_184,c_2828]) ).
tff(c_2852,plain,
create_slb = '#skF_6',
inference(negUnitSimplification,[status(thm)],[c_1590,c_2846]) ).
tff(c_118,plain,
! [U_123,V_124] : ( findmin_cpq_eff(triple(U_123,create_slb,V_124)) = triple(U_123,create_slb,bad) ),
inference(cnfTransformation,[status(thm)],[f_324]) ).
tff(c_2861,plain,
! [U_123,V_124] : ( findmin_cpq_eff(triple(U_123,'#skF_6',V_124)) = triple(U_123,'#skF_6',bad) ),
inference(demodulation,[status(thm),theory(equality)],[c_2852,c_2852,c_118]) ).
tff(c_3300,plain,
phi(triple('#skF_5','#skF_6',bad)),
inference(demodulation,[status(thm),theory(equality)],[c_2861,c_184]) ).
tff(c_3323,plain,
ok(triple('#skF_5','#skF_6',bad)),
inference(resolution,[status(thm)],[c_3300,c_180]) ).
tff(c_3327,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_106,c_3323]) ).
tff(c_3328,plain,
create_slb = '#skF_6',
inference(splitRight,[status(thm)],[c_639]) ).
tff(c_134,plain,
! [U_145,V_146] : ( i(triple(U_145,create_slb,V_146)) = create_pq ),
inference(cnfTransformation,[status(thm)],[f_389]) ).
tff(c_3335,plain,
! [U_145,V_146] : ( i(triple(U_145,'#skF_6',V_146)) = create_pq ),
inference(demodulation,[status(thm),theory(equality)],[c_3328,c_134]) ).
tff(c_3329,plain,
contains_pq(i(triple('#skF_5','#skF_6','#skF_7')),findmin_pqp_res('#skF_5')),
inference(splitRight,[status(thm)],[c_639]) ).
tff(c_3386,plain,
contains_pq(create_pq,findmin_pqp_res('#skF_5')),
inference(demodulation,[status(thm),theory(equality)],[c_3335,c_3329]) ).
tff(c_3389,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_20,c_3386]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SWV372+1 : TPTP v8.1.2. Released v3.3.0.
% 0.14/0.15 % 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.36 % Computer : n024.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 : Thu Aug 3 22:26:15 EDT 2023
% 0.14/0.37 % CPUTime :
% 7.50/2.72 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.50/2.73
% 7.50/2.73 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 7.68/2.76
% 7.68/2.76 Inference rules
% 7.68/2.76 ----------------------
% 7.68/2.76 #Ref : 0
% 7.68/2.76 #Sup : 742
% 7.68/2.76 #Fact : 8
% 7.68/2.76 #Define : 0
% 7.68/2.76 #Split : 1
% 7.68/2.76 #Chain : 0
% 7.68/2.76 #Close : 0
% 7.68/2.76
% 7.68/2.76 Ordering : KBO
% 7.68/2.76
% 7.68/2.76 Simplification rules
% 7.68/2.76 ----------------------
% 7.68/2.76 #Subsume : 111
% 7.68/2.76 #Demod : 206
% 7.68/2.76 #Tautology : 269
% 7.68/2.76 #SimpNegUnit : 43
% 7.68/2.76 #BackRed : 40
% 7.68/2.76
% 7.68/2.76 #Partial instantiations: 0
% 7.68/2.76 #Strategies tried : 1
% 7.68/2.76
% 7.68/2.76 Timing (in seconds)
% 7.68/2.76 ----------------------
% 7.68/2.76 Preprocessing : 0.69
% 7.68/2.76 Parsing : 0.36
% 7.68/2.76 CNF conversion : 0.05
% 7.68/2.76 Main loop : 1.00
% 7.68/2.76 Inferencing : 0.36
% 7.68/2.76 Reduction : 0.32
% 7.68/2.76 Demodulation : 0.22
% 7.68/2.76 BG Simplification : 0.05
% 7.68/2.76 Subsumption : 0.19
% 7.68/2.76 Abstraction : 0.04
% 7.68/2.76 MUC search : 0.00
% 7.68/2.76 Cooper : 0.00
% 7.68/2.76 Total : 1.74
% 7.68/2.76 Index Insertion : 0.00
% 7.68/2.76 Index Deletion : 0.00
% 7.68/2.76 Index Matching : 0.00
% 7.68/2.76 BG Taut test : 0.00
%------------------------------------------------------------------------------