TSTP Solution File: SET072+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET072+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n019.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 : Wed Aug 31 18:18:55 EDT 2022
% Result : Theorem 0.21s 0.51s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 3
% Syntax : Number of formulae : 29 ( 8 unt; 0 def)
% Number of atoms : 88 ( 44 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 85 ( 26 ~; 24 |; 29 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 42 ( 33 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f110,plain,
$false,
inference(subsumption_resolution,[],[f109,f67]) ).
fof(f67,plain,
sK0 != sK1,
inference(cnf_transformation,[],[f55]) ).
fof(f55,plain,
( member(sK1,universal_class)
& sK0 != sK1
& member(sK0,universal_class)
& unordered_pair(sK1,sK2) = unordered_pair(sK0,sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f51,f54]) ).
fof(f54,plain,
( ? [X0,X1,X2] :
( member(X1,universal_class)
& X0 != X1
& member(X0,universal_class)
& unordered_pair(X1,X2) = unordered_pair(X0,X2) )
=> ( member(sK1,universal_class)
& sK0 != sK1
& member(sK0,universal_class)
& unordered_pair(sK1,sK2) = unordered_pair(sK0,sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f51,plain,
? [X0,X1,X2] :
( member(X1,universal_class)
& X0 != X1
& member(X0,universal_class)
& unordered_pair(X1,X2) = unordered_pair(X0,X2) ),
inference(flattening,[],[f50]) ).
fof(f50,plain,
? [X2,X1,X0] :
( X0 != X1
& unordered_pair(X1,X2) = unordered_pair(X0,X2)
& member(X0,universal_class)
& member(X1,universal_class) ),
inference(ennf_transformation,[],[f46]) ).
fof(f46,plain,
~ ! [X2,X1,X0] :
( ( unordered_pair(X1,X2) = unordered_pair(X0,X2)
& member(X0,universal_class)
& member(X1,universal_class) )
=> X0 = X1 ),
inference(rectify,[],[f45]) ).
fof(f45,negated_conjecture,
~ ! [X1,X0,X4] :
( ( member(X0,universal_class)
& unordered_pair(X0,X4) = unordered_pair(X1,X4)
& member(X1,universal_class) )
=> X0 = X1 ),
inference(negated_conjecture,[],[f44]) ).
fof(f44,conjecture,
! [X1,X0,X4] :
( ( member(X0,universal_class)
& unordered_pair(X0,X4) = unordered_pair(X1,X4)
& member(X1,universal_class) )
=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_cancellation) ).
fof(f109,plain,
sK0 = sK1,
inference(subsumption_resolution,[],[f107,f66]) ).
fof(f66,plain,
member(sK0,universal_class),
inference(cnf_transformation,[],[f55]) ).
fof(f107,plain,
( ~ member(sK0,universal_class)
| sK0 = sK1 ),
inference(resolution,[],[f97,f79]) ).
fof(f79,plain,
! [X2,X1] :
( member(X2,unordered_pair(X2,X1))
| ~ member(X2,universal_class) ),
inference(equality_resolution,[],[f61]) ).
fof(f61,plain,
! [X2,X0,X1] :
( member(X0,unordered_pair(X2,X1))
| X0 != X2
| ~ member(X0,universal_class) ),
inference(cnf_transformation,[],[f53]) ).
fof(f53,plain,
! [X0,X1,X2] :
( ( ( ( X0 = X1
| X0 = X2 )
& member(X0,universal_class) )
| ~ member(X0,unordered_pair(X2,X1)) )
& ( member(X0,unordered_pair(X2,X1))
| ( X0 != X1
& X0 != X2 )
| ~ member(X0,universal_class) ) ),
inference(flattening,[],[f52]) ).
fof(f52,plain,
! [X0,X1,X2] :
( ( ( ( X0 = X1
| X0 = X2 )
& member(X0,universal_class) )
| ~ member(X0,unordered_pair(X2,X1)) )
& ( member(X0,unordered_pair(X2,X1))
| ( X0 != X1
& X0 != X2 )
| ~ member(X0,universal_class) ) ),
inference(nnf_transformation,[],[f47]) ).
fof(f47,plain,
! [X0,X1,X2] :
( ( ( X0 = X1
| X0 = X2 )
& member(X0,universal_class) )
<=> member(X0,unordered_pair(X2,X1)) ),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
! [X2,X1,X0] :
( ( ( X1 = X2
| X0 = X2 )
& member(X2,universal_class) )
<=> member(X2,unordered_pair(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair_defn) ).
fof(f97,plain,
! [X0] :
( ~ member(X0,unordered_pair(sK0,sK1))
| sK1 = X0 ),
inference(forward_demodulation,[],[f96,f92]) ).
fof(f92,plain,
sK2 = sK1,
inference(subsumption_resolution,[],[f90,f67]) ).
fof(f90,plain,
( sK0 = sK1
| sK2 = sK1 ),
inference(resolution,[],[f64,f86]) ).
fof(f86,plain,
member(sK1,unordered_pair(sK0,sK2)),
inference(subsumption_resolution,[],[f85,f68]) ).
fof(f68,plain,
member(sK1,universal_class),
inference(cnf_transformation,[],[f55]) ).
fof(f85,plain,
( member(sK1,unordered_pair(sK0,sK2))
| ~ member(sK1,universal_class) ),
inference(superposition,[],[f79,f65]) ).
fof(f65,plain,
unordered_pair(sK1,sK2) = unordered_pair(sK0,sK2),
inference(cnf_transformation,[],[f55]) ).
fof(f64,plain,
! [X2,X0,X1] :
( ~ member(X0,unordered_pair(X2,X1))
| X0 = X2
| X0 = X1 ),
inference(cnf_transformation,[],[f53]) ).
fof(f96,plain,
! [X0] :
( ~ member(X0,unordered_pair(sK0,sK2))
| sK1 = X0 ),
inference(duplicate_literal_removal,[],[f93]) ).
fof(f93,plain,
! [X0] :
( ~ member(X0,unordered_pair(sK0,sK2))
| sK1 = X0
| sK1 = X0 ),
inference(backward_demodulation,[],[f91,f92]) ).
fof(f91,plain,
! [X0] :
( ~ member(X0,unordered_pair(sK0,sK2))
| sK1 = X0
| sK2 = X0 ),
inference(superposition,[],[f64,f65]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET072+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.07/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.34 % Computer : n019.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 30 13:11:20 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.49 % (637)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.21/0.50 % (673)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.21/0.50 % (647)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.50 % (679)dis+2_3:1_aac=none:abs=on:ep=R:lcm=reverse:nwc=10.0:sos=on:sp=const_frequency:spb=units:urr=ec_only:i=8:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/8Mi)
% 0.21/0.51 % (636)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.21/0.51 % (636)First to succeed.
% 0.21/0.51 % (636)Refutation found. Thanks to Tanya!
% 0.21/0.51 % SZS status Theorem for theBenchmark
% 0.21/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.51 % (636)------------------------------
% 0.21/0.51 % (636)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.51 % (636)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.51 % (636)Termination reason: Refutation
% 0.21/0.51
% 0.21/0.51 % (636)Memory used [KB]: 6012
% 0.21/0.51 % (636)Time elapsed: 0.109 s
% 0.21/0.51 % (636)Instructions burned: 2 (million)
% 0.21/0.51 % (636)------------------------------
% 0.21/0.51 % (636)------------------------------
% 0.21/0.51 % (624)Success in time 0.156 s
%------------------------------------------------------------------------------