TSTP Solution File: SWV415+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV415+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 : n029.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:03 EDT 2023
% Result : Theorem 30.72s 14.59s
% Output : CNFRefutation 30.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 57
% Syntax : Number of formulae : 67 ( 14 unt; 53 typ; 0 def)
% Number of atoms : 14 ( 13 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 5 ( 2 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 : 34 ( 34 usr; 8 con; 0-3 aty)
% Number of variables : 51 (; 51 !; 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_8 > #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('#skF_8',type,
'#skF_8': $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_305,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/sandbox2/benchmark/Axioms/SWV007+3.ax',ax42) ).
tff(f_435,lemma,
! [U,V,W,X,Y] : ( i(triple(U,W,X)) = i(triple(V,W,Y)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main2_l12) ).
tff(f_391,axiom,
! [U,V,W,X,Y] : ( i(triple(U,insert_slb(V,pair(X,Y)),W)) = insert_pq(i(triple(U,V,W)),X) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+4.ax',ax55) ).
tff(f_438,negated_conjecture,
~ ! [U,V,W,X] : ( i(insert_cpq(triple(U,V,W),X)) = insert_pq(i(triple(U,V,W)),X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co2) ).
tff(c_110,plain,
! [U_107,X_110,V_108,W_109] : ( triple(insert_pqp(U_107,X_110),insert_slb(V_108,pair(X_110,bottom)),W_109) = insert_cpq(triple(U_107,V_108,W_109),X_110) ),
inference(cnfTransformation,[status(thm)],[f_305]) ).
tff(c_174,plain,
! [V_173,U_172,Y_176,X_175,W_174] : ( i(triple(V_173,W_174,Y_176)) = i(triple(U_172,W_174,X_175)) ),
inference(cnfTransformation,[status(thm)],[f_435]) ).
tff(c_2217,plain,
! [W_484,Y_482,X_483,U_486,V_485] : ( i(triple(U_486,insert_slb(V_485,pair(X_483,Y_482)),W_484)) = insert_pq(i(triple(U_486,V_485,W_484)),X_483) ),
inference(cnfTransformation,[status(thm)],[f_391]) ).
tff(c_126031,plain,
! [X_25798,Y_25797,U_25799,Y_25796,V_25800,X_25795,V_25794] : ( insert_pq(i(triple(V_25794,V_25800,Y_25797)),X_25795) = i(triple(U_25799,insert_slb(V_25800,pair(X_25795,Y_25796)),X_25798)) ),
inference(superposition,[status(thm),theory(equality)],[c_174,c_2217]) ).
tff(c_868,plain,
! [X_348,W_350,U_349,Y_347,V_346] : ( i(triple(V_346,W_350,Y_347)) = i(triple(U_349,W_350,X_348)) ),
inference(cnfTransformation,[status(thm)],[f_435]) ).
tff(c_176,plain,
insert_pq(i(triple('#skF_5','#skF_6','#skF_7')),'#skF_8') != i(insert_cpq(triple('#skF_5','#skF_6','#skF_7'),'#skF_8')),
inference(cnfTransformation,[status(thm)],[f_438]) ).
tff(c_972,plain,
! [U_349,X_348] : ( insert_pq(i(triple(U_349,'#skF_6',X_348)),'#skF_8') != i(insert_cpq(triple('#skF_5','#skF_6','#skF_7'),'#skF_8')) ),
inference(superposition,[status(thm),theory(equality)],[c_868,c_176]) ).
tff(c_131570,plain,
! [U_26167,Y_26168,X_26169] : ( i(triple(U_26167,insert_slb('#skF_6',pair('#skF_8',Y_26168)),X_26169)) != i(insert_cpq(triple('#skF_5','#skF_6','#skF_7'),'#skF_8')) ),
inference(superposition,[status(thm),theory(equality)],[c_126031,c_972]) ).
tff(c_131606,plain,
! [U_107,W_109] : ( i(insert_cpq(triple(U_107,'#skF_6',W_109),'#skF_8')) != i(insert_cpq(triple('#skF_5','#skF_6','#skF_7'),'#skF_8')) ),
inference(superposition,[status(thm),theory(equality)],[c_110,c_131570]) ).
tff(c_163757,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_131606]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV415+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/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 : n029.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 : Thu Aug 3 23:24:08 EDT 2023
% 0.14/0.35 % CPUTime :
% 30.72/14.59 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 30.72/14.60
% 30.72/14.60 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 30.72/14.62
% 30.72/14.62 Inference rules
% 30.72/14.62 ----------------------
% 30.72/14.62 #Ref : 2
% 30.72/14.62 #Sup : 31070
% 30.72/14.62 #Fact : 20
% 30.72/14.62 #Define : 0
% 30.72/14.62 #Split : 10
% 30.72/14.62 #Chain : 0
% 30.72/14.62 #Close : 0
% 30.72/14.62
% 30.72/14.62 Ordering : KBO
% 30.72/14.62
% 30.72/14.62 Simplification rules
% 30.72/14.62 ----------------------
% 30.72/14.62 #Subsume : 4835
% 30.72/14.62 #Demod : 4723
% 30.72/14.62 #Tautology : 890
% 30.72/14.62 #SimpNegUnit : 96
% 30.72/14.62 #BackRed : 1
% 30.72/14.62
% 30.72/14.62 #Partial instantiations: 21624
% 30.72/14.62 #Strategies tried : 1
% 30.72/14.62
% 30.72/14.62 Timing (in seconds)
% 30.72/14.62 ----------------------
% 30.72/14.62 Preprocessing : 0.69
% 30.72/14.62 Parsing : 0.35
% 30.72/14.62 CNF conversion : 0.05
% 30.72/14.62 Main loop : 12.89
% 30.72/14.62 Inferencing : 2.19
% 30.72/14.62 Reduction : 5.62
% 30.72/14.62 Demodulation : 4.76
% 30.72/14.63 BG Simplification : 0.27
% 30.72/14.63 Subsumption : 4.21
% 30.72/14.63 Abstraction : 0.30
% 30.72/14.63 MUC search : 0.00
% 30.72/14.63 Cooper : 0.00
% 30.72/14.63 Total : 13.62
% 30.72/14.63 Index Insertion : 0.00
% 30.72/14.63 Index Deletion : 0.00
% 30.72/14.63 Index Matching : 0.00
% 30.72/14.63 BG Taut test : 0.00
%------------------------------------------------------------------------------