TSTP Solution File: SWV366+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SWV366+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n012.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 : Thu Aug 31 21:38:16 EDT 2023
% Result : Theorem 0.20s 0.66s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 58
% Syntax : Number of formulae : 66 ( 7 unt; 56 typ; 0 def)
% Number of atoms : 13 ( 12 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 6 ( 3 ~; 0 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 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 : 37 ( 37 usr; 11 con; 0-3 aty)
% Number of variables : 51 ( 10 sgn; 36 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
less_than: ( $i * $i ) > $o ).
tff(decl_23,type,
strictly_less_than: ( $i * $i ) > $o ).
tff(decl_24,type,
bottom: $i ).
tff(decl_25,type,
create_pq: $i ).
tff(decl_26,type,
isnonempty_pq: $i > $o ).
tff(decl_27,type,
insert_pq: ( $i * $i ) > $i ).
tff(decl_28,type,
contains_pq: ( $i * $i ) > $o ).
tff(decl_29,type,
issmallestelement_pq: ( $i * $i ) > $o ).
tff(decl_30,type,
remove_pq: ( $i * $i ) > $i ).
tff(decl_31,type,
findmin_pq_eff: ( $i * $i ) > $i ).
tff(decl_32,type,
findmin_pq_res: ( $i * $i ) > $i ).
tff(decl_33,type,
removemin_pq_eff: ( $i * $i ) > $i ).
tff(decl_34,type,
removemin_pq_res: ( $i * $i ) > $i ).
tff(decl_35,type,
create_slb: $i ).
tff(decl_36,type,
isnonempty_slb: $i > $o ).
tff(decl_37,type,
pair: ( $i * $i ) > $i ).
tff(decl_38,type,
insert_slb: ( $i * $i ) > $i ).
tff(decl_39,type,
contains_slb: ( $i * $i ) > $o ).
tff(decl_40,type,
pair_in_list: ( $i * $i * $i ) > $o ).
tff(decl_41,type,
remove_slb: ( $i * $i ) > $i ).
tff(decl_42,type,
lookup_slb: ( $i * $i ) > $i ).
tff(decl_43,type,
update_slb: ( $i * $i ) > $i ).
tff(decl_44,type,
succ_cpq: ( $i * $i ) > $o ).
tff(decl_45,type,
insert_cpq: ( $i * $i ) > $i ).
tff(decl_46,type,
remove_cpq: ( $i * $i ) > $i ).
tff(decl_47,type,
findmin_cpq_eff: $i > $i ).
tff(decl_48,type,
removemin_cpq_eff: $i > $i ).
tff(decl_49,type,
triple: ( $i * $i * $i ) > $i ).
tff(decl_50,type,
check_cpq: $i > $o ).
tff(decl_51,type,
contains_cpq: ( $i * $i ) > $o ).
tff(decl_52,type,
bad: $i ).
tff(decl_53,type,
ok: $i > $o ).
tff(decl_54,type,
insert_pqp: ( $i * $i ) > $i ).
tff(decl_55,type,
remove_pqp: ( $i * $i ) > $i ).
tff(decl_56,type,
findmin_pqp_res: $i > $i ).
tff(decl_57,type,
findmin_cpq_res: $i > $i ).
tff(decl_58,type,
removemin_cpq_res: $i > $i ).
tff(decl_59,type,
i: $i > $i ).
tff(decl_60,type,
pi_sharp_remove: ( $i * $i ) > $o ).
tff(decl_61,type,
pi_remove: ( $i * $i ) > $o ).
tff(decl_62,type,
pi_sharp_find_min: ( $i * $i ) > $o ).
tff(decl_63,type,
pi_find_min: $i > $o ).
tff(decl_64,type,
pi_sharp_removemin: ( $i * $i ) > $o ).
tff(decl_65,type,
pi_removemin: $i > $o ).
tff(decl_66,type,
phi: $i > $o ).
tff(decl_67,type,
esk1_2: ( $i * $i ) > $i ).
tff(decl_68,type,
esk2_1: $i > $i ).
tff(decl_69,type,
esk3_1: $i > $i ).
tff(decl_70,type,
esk4_1: $i > $i ).
tff(decl_71,type,
esk5_0: $i ).
tff(decl_72,type,
esk6_0: $i ).
tff(decl_73,type,
esk7_0: $i ).
tff(decl_74,type,
esk8_0: $i ).
tff(decl_75,type,
esk9_0: $i ).
tff(decl_76,type,
esk10_0: $i ).
tff(decl_77,type,
esk11_0: $i ).
fof(l2_co,conjecture,
! [X1] :
( ! [X2,X3,X4,X5] : i(triple(X2,X1,X4)) = i(triple(X3,X1,X5))
=> ! [X6,X7,X8,X9,X10,X11] : i(triple(X6,insert_slb(X1,pair(X10,X11)),X8)) = i(triple(X7,insert_slb(X1,pair(X10,X11)),X9)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l2_co) ).
fof(ax55,axiom,
! [X1,X2,X3,X4,X5] : i(triple(X1,insert_slb(X2,pair(X4,X5)),X3)) = insert_pq(i(triple(X1,X2,X3)),X4),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+4.ax',ax55) ).
fof(c_0_2,negated_conjecture,
~ ! [X1] :
( ! [X2,X3,X4,X5] : i(triple(X2,X1,X4)) = i(triple(X3,X1,X5))
=> ! [X6,X7,X8,X9,X10,X11] : i(triple(X6,insert_slb(X1,pair(X10,X11)),X8)) = i(triple(X7,insert_slb(X1,pair(X10,X11)),X9)) ),
inference(assume_negation,[status(cth)],[l2_co]) ).
fof(c_0_3,plain,
! [X155,X156,X157,X158,X159] : i(triple(X155,insert_slb(X156,pair(X158,X159)),X157)) = insert_pq(i(triple(X155,X156,X157)),X158),
inference(variable_rename,[status(thm)],[ax55]) ).
fof(c_0_4,negated_conjecture,
! [X181,X182,X183,X184] :
( i(triple(X181,esk5_0,X183)) = i(triple(X182,esk5_0,X184))
& i(triple(esk6_0,insert_slb(esk5_0,pair(esk10_0,esk11_0)),esk8_0)) != i(triple(esk7_0,insert_slb(esk5_0,pair(esk10_0,esk11_0)),esk9_0)) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).
cnf(c_0_5,plain,
i(triple(X1,insert_slb(X2,pair(X3,X4)),X5)) = insert_pq(i(triple(X1,X2,X5)),X3),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
i(triple(X1,esk5_0,X2)) = i(triple(X3,esk5_0,X4)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
i(triple(esk6_0,insert_slb(esk5_0,pair(esk10_0,esk11_0)),esk8_0)) != i(triple(esk7_0,insert_slb(esk5_0,pair(esk10_0,esk11_0)),esk9_0)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
i(triple(X1,insert_slb(esk5_0,pair(X2,X3)),X4)) = i(triple(X5,insert_slb(esk5_0,pair(X2,bottom)),X6)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_5]) ).
cnf(c_0_9,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8]),c_0_8])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV366+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n012.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 : Tue Aug 29 05:41:09 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.61 start to proof: theBenchmark
% 0.20/0.66 % Version : CSE_E---1.5
% 0.20/0.66 % Problem : theBenchmark.p
% 0.20/0.66 % Proof found
% 0.20/0.66 % SZS status Theorem for theBenchmark.p
% 0.20/0.66 % SZS output start Proof
% See solution above
% 0.20/0.67 % Total time : 0.038000 s
% 0.20/0.67 % SZS output end Proof
% 0.20/0.67 % Total time : 0.043000 s
%------------------------------------------------------------------------------