TSTP Solution File: SWV369+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SWV369+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 : n001.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.15s 0.55s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 57
% Syntax : Number of formulae : 72 ( 13 unt; 52 typ; 0 def)
% Number of atoms : 31 ( 3 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 25 ( 14 ~; 6 |; 2 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 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 : 32 ( 6 sgn; 24 !; 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(l5_co,conjecture,
! [X1,X2,X3] :
( contains_cpq(triple(X1,create_slb,X2),X3)
<=> contains_pq(i(triple(X1,create_slb,X2)),X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l5_co) ).
fof(ax8,axiom,
! [X1] : ~ contains_pq(create_pq,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+1.ax',ax8) ).
fof(ax54,axiom,
! [X1,X2] : i(triple(X1,create_slb,X2)) = create_pq,
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+4.ax',ax54) ).
fof(ax20,axiom,
! [X1] : ~ contains_slb(create_slb,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax',ax20) ).
fof(ax39,axiom,
! [X1,X2,X3,X4] :
( contains_cpq(triple(X1,X2,X3),X4)
<=> contains_slb(X2,X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+3.ax',ax39) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2,X3] :
( contains_cpq(triple(X1,create_slb,X2),X3)
<=> contains_pq(i(triple(X1,create_slb,X2)),X3) ),
inference(assume_negation,[status(cth)],[l5_co]) ).
fof(c_0_6,plain,
! [X1] : ~ contains_pq(create_pq,X1),
inference(fof_simplification,[status(thm)],[ax8]) ).
fof(c_0_7,negated_conjecture,
( ( ~ contains_cpq(triple(esk5_0,create_slb,esk6_0),esk7_0)
| ~ contains_pq(i(triple(esk5_0,create_slb,esk6_0)),esk7_0) )
& ( contains_cpq(triple(esk5_0,create_slb,esk6_0),esk7_0)
| contains_pq(i(triple(esk5_0,create_slb,esk6_0)),esk7_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_8,plain,
! [X147,X148] : i(triple(X147,create_slb,X148)) = create_pq,
inference(variable_rename,[status(thm)],[ax54]) ).
fof(c_0_9,plain,
! [X17] : ~ contains_pq(create_pq,X17),
inference(variable_rename,[status(thm)],[c_0_6]) ).
fof(c_0_10,plain,
! [X1] : ~ contains_slb(create_slb,X1),
inference(fof_simplification,[status(thm)],[ax20]) ).
fof(c_0_11,plain,
! [X104,X105,X106,X107] :
( ( ~ contains_cpq(triple(X104,X105,X106),X107)
| contains_slb(X105,X107) )
& ( ~ contains_slb(X105,X107)
| contains_cpq(triple(X104,X105,X106),X107) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax39])]) ).
cnf(c_0_12,negated_conjecture,
( contains_cpq(triple(esk5_0,create_slb,esk6_0),esk7_0)
| contains_pq(i(triple(esk5_0,create_slb,esk6_0)),esk7_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
i(triple(X1,create_slb,X2)) = create_pq,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
~ contains_pq(create_pq,X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_15,plain,
! [X46] : ~ contains_slb(create_slb,X46),
inference(variable_rename,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( contains_slb(X2,X4)
| ~ contains_cpq(triple(X1,X2,X3),X4) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
contains_cpq(triple(esk5_0,create_slb,esk6_0),esk7_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_18,plain,
~ contains_slb(create_slb,X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWV369+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.11 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.31 % Computer : n001.cluster.edu
% 0.12/0.31 % Model : x86_64 x86_64
% 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31 % Memory : 8042.1875MB
% 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31 % CPULimit : 300
% 0.12/0.31 % WCLimit : 300
% 0.12/0.31 % DateTime : Tue Aug 29 09:41:37 EDT 2023
% 0.12/0.31 % CPUTime :
% 0.15/0.53 start to proof: theBenchmark
% 0.15/0.55 % Version : CSE_E---1.5
% 0.15/0.55 % Problem : theBenchmark.p
% 0.15/0.55 % Proof found
% 0.15/0.55 % SZS status Theorem for theBenchmark.p
% 0.15/0.55 % SZS output start Proof
% See solution above
% 0.15/0.55 % Total time : 0.010000 s
% 0.15/0.55 % SZS output end Proof
% 0.15/0.55 % Total time : 0.013000 s
%------------------------------------------------------------------------------