TSTP Solution File: SWV371+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SWV371+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 : n009.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:17 EDT 2023
% Result : Theorem 0.54s 0.60s
% Output : CNFRefutation 0.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 56
% Syntax : Number of formulae : 69 ( 4 unt; 52 typ; 0 def)
% Number of atoms : 37 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 36 ( 16 ~; 11 |; 4 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 76 ( 45 >; 31 *; 0 +; 0 <<)
% Number of predicates : 20 ( 19 usr; 1 prp; 0-3 aty)
% Number of functors : 33 ( 33 usr; 7 con; 0-3 aty)
% Number of variables : 30 ( 0 sgn; 22 !; 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 ).
fof(l7_co,conjecture,
! [X1,X2,X3] :
( phi(findmin_cpq_eff(triple(X1,X2,X3)))
=> pi_sharp_find_min(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l7_co) ).
fof(ax58,axiom,
! [X1,X2] :
( pi_sharp_find_min(X1,X2)
<=> ( contains_pq(X1,X2)
& issmallestelement_pq(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+4.ax',ax58) ).
fof(l7_lX,lemma,
! [X1,X2,X3] :
( phi(findmin_cpq_eff(triple(X1,X2,X3)))
=> issmallestelement_pq(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l7_lX) ).
fof(l7_l8,lemma,
! [X1,X2,X3] :
( phi(findmin_cpq_eff(triple(X1,X2,X3)))
=> contains_pq(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l7_l8) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X3] :
( phi(findmin_cpq_eff(triple(X1,X2,X3)))
=> pi_sharp_find_min(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3))) ),
inference(assume_negation,[status(cth)],[l7_co]) ).
fof(c_0_5,negated_conjecture,
( phi(findmin_cpq_eff(triple(esk5_0,esk6_0,esk7_0)))
& ~ pi_sharp_find_min(i(triple(esk5_0,esk6_0,esk7_0)),findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_6,plain,
! [X158,X159] :
( ( contains_pq(X158,X159)
| ~ pi_sharp_find_min(X158,X159) )
& ( issmallestelement_pq(X158,X159)
| ~ pi_sharp_find_min(X158,X159) )
& ( ~ contains_pq(X158,X159)
| ~ issmallestelement_pq(X158,X159)
| pi_sharp_find_min(X158,X159) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax58])])]) ).
cnf(c_0_7,negated_conjecture,
~ pi_sharp_find_min(i(triple(esk5_0,esk6_0,esk7_0)),findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0))),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( pi_sharp_find_min(X1,X2)
| ~ contains_pq(X1,X2)
| ~ issmallestelement_pq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,lemma,
! [X177,X178,X179] :
( ~ phi(findmin_cpq_eff(triple(X177,X178,X179)))
| issmallestelement_pq(i(triple(X177,X178,X179)),findmin_cpq_res(triple(X177,X178,X179))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l7_lX])]) ).
cnf(c_0_10,negated_conjecture,
( ~ issmallestelement_pq(i(triple(esk5_0,esk6_0,esk7_0)),findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0)))
| ~ contains_pq(i(triple(esk5_0,esk6_0,esk7_0)),findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0))) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,lemma,
( issmallestelement_pq(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3)))
| ~ phi(findmin_cpq_eff(triple(X1,X2,X3))) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,negated_conjecture,
phi(findmin_cpq_eff(triple(esk5_0,esk6_0,esk7_0))),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_13,lemma,
! [X174,X175,X176] :
( ~ phi(findmin_cpq_eff(triple(X174,X175,X176)))
| contains_pq(i(triple(X174,X175,X176)),findmin_cpq_res(triple(X174,X175,X176))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l7_l8])]) ).
cnf(c_0_14,negated_conjecture,
~ contains_pq(i(triple(esk5_0,esk6_0,esk7_0)),findmin_cpq_res(triple(esk5_0,esk6_0,esk7_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
cnf(c_0_15,lemma,
( contains_pq(i(triple(X1,X2,X3)),findmin_cpq_res(triple(X1,X2,X3)))
| ~ phi(findmin_cpq_eff(triple(X1,X2,X3))) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,lemma,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWV371+1 : TPTP v8.1.2. Released v3.3.0.
% 0.11/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n009.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 02:57:35 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.57 start to proof: theBenchmark
% 0.54/0.60 % Version : CSE_E---1.5
% 0.54/0.60 % Problem : theBenchmark.p
% 0.54/0.60 % Proof found
% 0.54/0.60 % SZS status Theorem for theBenchmark.p
% 0.54/0.60 % SZS output start Proof
% See solution above
% 0.54/0.60 % Total time : 0.023000 s
% 0.54/0.60 % SZS output end Proof
% 0.54/0.60 % Total time : 0.027000 s
%------------------------------------------------------------------------------