TSTP Solution File: SWV411+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SWV411+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:28 EDT 2023
% Result : Theorem 0.47s 0.62s
% Output : CNFRefutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 20
% Syntax : Number of formulae : 37 ( 6 unt; 17 typ; 0 def)
% Number of atoms : 59 ( 16 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 57 ( 18 ~; 23 |; 8 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 21 ( 11 >; 10 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 56 ( 9 sgn; 30 !; 4 ?; 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_slb: $i ).
tff(decl_26,type,
isnonempty_slb: $i > $o ).
tff(decl_27,type,
pair: ( $i * $i ) > $i ).
tff(decl_28,type,
insert_slb: ( $i * $i ) > $i ).
tff(decl_29,type,
contains_slb: ( $i * $i ) > $o ).
tff(decl_30,type,
pair_in_list: ( $i * $i * $i ) > $o ).
tff(decl_31,type,
remove_slb: ( $i * $i ) > $i ).
tff(decl_32,type,
lookup_slb: ( $i * $i ) > $i ).
tff(decl_33,type,
update_slb: ( $i * $i ) > $i ).
tff(decl_34,type,
esk1_0: $i ).
tff(decl_35,type,
esk2_1: $i > $i ).
tff(decl_36,type,
esk3_0: $i ).
tff(decl_37,type,
esk4_0: $i ).
tff(decl_38,type,
esk5_0: $i ).
fof(l47_co,conjecture,
! [X1] :
( ! [X2] :
( contains_slb(X1,X2)
=> ? [X3] : pair_in_list(X1,X2,X3) )
=> ! [X4,X5,X6] :
( contains_slb(insert_slb(X1,pair(X5,X6)),X4)
=> ? [X7] : pair_in_list(insert_slb(X1,pair(X5,X6)),X4,X7) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l47_co) ).
fof(ax21,axiom,
! [X1,X2,X3,X4] :
( contains_slb(insert_slb(X1,pair(X2,X4)),X3)
<=> ( contains_slb(X1,X3)
| X2 = X3 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax',ax21) ).
fof(ax23,axiom,
! [X1,X2,X3,X4,X5] :
( pair_in_list(insert_slb(X1,pair(X2,X4)),X3,X5)
<=> ( pair_in_list(X1,X3,X5)
| ( X2 = X3
& X4 = X5 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+2.ax',ax23) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] :
( ! [X2] :
( contains_slb(X1,X2)
=> ? [X3] : pair_in_list(X1,X2,X3) )
=> ! [X4,X5,X6] :
( contains_slb(insert_slb(X1,pair(X5,X6)),X4)
=> ? [X7] : pair_in_list(insert_slb(X1,pair(X5,X6)),X4,X7) ) ),
inference(assume_negation,[status(cth)],[l47_co]) ).
fof(c_0_4,plain,
! [X21,X22,X23,X24] :
( ( ~ contains_slb(insert_slb(X21,pair(X22,X24)),X23)
| contains_slb(X21,X23)
| X22 = X23 )
& ( ~ contains_slb(X21,X23)
| contains_slb(insert_slb(X21,pair(X22,X24)),X23) )
& ( X22 != X23
| contains_slb(insert_slb(X21,pair(X22,X24)),X23) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax21])])]) ).
fof(c_0_5,negated_conjecture,
! [X56,X61] :
( ( ~ contains_slb(esk1_0,X56)
| pair_in_list(esk1_0,X56,esk2_1(X56)) )
& contains_slb(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0)
& ~ pair_in_list(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0,X61) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
cnf(c_0_6,plain,
( contains_slb(X1,X4)
| X2 = X4
| ~ contains_slb(insert_slb(X1,pair(X2,X3)),X4) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
contains_slb(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X27,X28,X29,X30,X31] :
( ( X28 = X29
| pair_in_list(X27,X29,X31)
| ~ pair_in_list(insert_slb(X27,pair(X28,X30)),X29,X31) )
& ( X30 = X31
| pair_in_list(X27,X29,X31)
| ~ pair_in_list(insert_slb(X27,pair(X28,X30)),X29,X31) )
& ( ~ pair_in_list(X27,X29,X31)
| pair_in_list(insert_slb(X27,pair(X28,X30)),X29,X31) )
& ( X28 != X29
| X30 != X31
| pair_in_list(insert_slb(X27,pair(X28,X30)),X29,X31) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax23])])]) ).
cnf(c_0_9,negated_conjecture,
( pair_in_list(esk1_0,X1,esk2_1(X1))
| ~ contains_slb(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
( esk3_0 = esk4_0
| contains_slb(esk1_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,plain,
( pair_in_list(insert_slb(X1,pair(X4,X5)),X2,X3)
| ~ pair_in_list(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( esk3_0 = esk4_0
| pair_in_list(esk1_0,esk3_0,esk2_1(esk3_0)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
~ pair_in_list(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk3_0,X1),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,negated_conjecture,
( esk3_0 = esk4_0
| pair_in_list(insert_slb(esk1_0,pair(X1,X2)),esk3_0,esk2_1(esk3_0)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
esk3_0 = esk4_0,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,plain,
( pair_in_list(insert_slb(X5,pair(X1,X3)),X2,X4)
| X1 != X2
| X3 != X4 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,negated_conjecture,
~ pair_in_list(insert_slb(esk1_0,pair(esk4_0,esk5_0)),esk4_0,X1),
inference(rw,[status(thm)],[c_0_13,c_0_15]) ).
cnf(c_0_18,plain,
pair_in_list(insert_slb(X1,pair(X2,X3)),X2,X3),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_16])]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_17,c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWV411+1 : TPTP v8.1.2. Released v3.3.0.
% 0.04/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.34 % Computer : n009.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Aug 29 09:17:35 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.47/0.60 start to proof: theBenchmark
% 0.47/0.62 % Version : CSE_E---1.5
% 0.47/0.62 % Problem : theBenchmark.p
% 0.47/0.62 % Proof found
% 0.47/0.62 % SZS status Theorem for theBenchmark.p
% 0.47/0.62 % SZS output start Proof
% See solution above
% 0.47/0.63 % Total time : 0.008000 s
% 0.47/0.63 % SZS output end Proof
% 0.47/0.63 % Total time : 0.011000 s
%------------------------------------------------------------------------------