TSTP Solution File: SET067+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SET067+1 : TPTP v8.2.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n004.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 : Tue May 21 03:15:49 EDT 2024
% Result : Theorem 1.41s 0.56s
% Output : Refutation 1.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 37 ( 14 unt; 0 def)
% Number of atoms : 95 ( 22 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 97 ( 39 ~; 35 |; 16 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 65 ( 58 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3669,plain,
$false,
inference(subsumption_resolution,[],[f3668,f3661]) ).
fof(f3661,plain,
member(sK0,universal_class),
inference(resolution,[],[f3649,f281]) ).
fof(f281,plain,
! [X0,X1] :
( ~ member(X1,singleton(X0))
| member(X1,universal_class) ),
inference(superposition,[],[f202,f141]) ).
fof(f141,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',singleton_set_defn) ).
fof(f202,plain,
! [X2,X0,X1] :
( ~ member(X0,unordered_pair(X1,X2))
| member(X0,universal_class) ),
inference(cnf_transformation,[],[f122]) ).
fof(f122,plain,
! [X0,X1,X2] :
( ( member(X0,unordered_pair(X1,X2))
| ( X0 != X2
& X0 != X1 )
| ~ member(X0,universal_class) )
& ( ( ( X0 = X2
| X0 = X1 )
& member(X0,universal_class) )
| ~ member(X0,unordered_pair(X1,X2)) ) ),
inference(flattening,[],[f121]) ).
fof(f121,plain,
! [X0,X1,X2] :
( ( member(X0,unordered_pair(X1,X2))
| ( X0 != X2
& X0 != X1 )
| ~ member(X0,universal_class) )
& ( ( ( X0 = X2
| X0 = X1 )
& member(X0,universal_class) )
| ~ member(X0,unordered_pair(X1,X2)) ) ),
inference(nnf_transformation,[],[f64]) ).
fof(f64,plain,
! [X0,X1,X2] :
( member(X0,unordered_pair(X1,X2))
<=> ( ( X0 = X2
| X0 = X1 )
& member(X0,universal_class) ) ),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
! [X2,X0,X1] :
( member(X2,unordered_pair(X0,X1))
<=> ( ( X1 = X2
| X0 = X2 )
& member(X2,universal_class) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unordered_pair_defn) ).
fof(f3649,plain,
member(sK0,singleton(sK0)),
inference(subsumption_resolution,[],[f3645,f231]) ).
fof(f231,plain,
~ subclass(singleton(sK0),unordered_pair(sK0,sK1)),
inference(superposition,[],[f135,f141]) ).
fof(f135,plain,
~ subclass(unordered_pair(sK0,sK0),unordered_pair(sK0,sK1)),
inference(cnf_transformation,[],[f86]) ).
fof(f86,plain,
~ subclass(unordered_pair(sK0,sK0),unordered_pair(sK0,sK1)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f71,f85]) ).
fof(f85,plain,
( ? [X0,X1] : ~ subclass(unordered_pair(X0,X0),unordered_pair(X0,X1))
=> ~ subclass(unordered_pair(sK0,sK0),unordered_pair(sK0,sK1)) ),
introduced(choice_axiom,[]) ).
fof(f71,plain,
? [X0,X1] : ~ subclass(unordered_pair(X0,X0),unordered_pair(X0,X1)),
inference(ennf_transformation,[],[f45]) ).
fof(f45,negated_conjecture,
~ ! [X0,X1] : subclass(unordered_pair(X0,X0),unordered_pair(X0,X1)),
inference(negated_conjecture,[],[f44]) ).
fof(f44,conjecture,
! [X0,X1] : subclass(unordered_pair(X0,X0),unordered_pair(X0,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pair_contains_other) ).
fof(f3645,plain,
( member(sK0,singleton(sK0))
| subclass(singleton(sK0),unordered_pair(sK0,sK1)) ),
inference(superposition,[],[f173,f3639]) ).
fof(f3639,plain,
sK0 = sK4(singleton(sK0),unordered_pair(sK0,sK1)),
inference(resolution,[],[f1035,f231]) ).
fof(f1035,plain,
! [X0,X1] :
( subclass(singleton(X0),X1)
| sK4(singleton(X0),X1) = X0 ),
inference(resolution,[],[f1026,f173]) ).
fof(f1026,plain,
! [X0,X1] :
( ~ member(X1,singleton(X0))
| X0 = X1 ),
inference(duplicate_literal_removal,[],[f1024]) ).
fof(f1024,plain,
! [X0,X1] :
( ~ member(X1,singleton(X0))
| X0 = X1
| X0 = X1 ),
inference(superposition,[],[f203,f141]) ).
fof(f203,plain,
! [X2,X0,X1] :
( ~ member(X0,unordered_pair(X1,X2))
| X0 = X1
| X0 = X2 ),
inference(cnf_transformation,[],[f122]) ).
fof(f173,plain,
! [X0,X1] :
( member(sK4(X0,X1),X0)
| subclass(X0,X1) ),
inference(cnf_transformation,[],[f102]) ).
fof(f102,plain,
! [X0,X1] :
( ( subclass(X0,X1)
| ( ~ member(sK4(X0,X1),X1)
& member(sK4(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subclass(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f100,f101]) ).
fof(f101,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK4(X0,X1),X1)
& member(sK4(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f100,plain,
! [X0,X1] :
( ( subclass(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subclass(X0,X1) ) ),
inference(rectify,[],[f99]) ).
fof(f99,plain,
! [X0,X1] :
( ( subclass(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subclass(X0,X1) ) ),
inference(nnf_transformation,[],[f80]) ).
fof(f80,plain,
! [X0,X1] :
( subclass(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] :
( subclass(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subclass_defn) ).
fof(f3668,plain,
~ member(sK0,universal_class),
inference(resolution,[],[f3650,f228]) ).
fof(f228,plain,
! [X2,X1] :
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
inference(equality_resolution,[],[f204]) ).
fof(f204,plain,
! [X2,X0,X1] :
( member(X0,unordered_pair(X1,X2))
| X0 != X1
| ~ member(X0,universal_class) ),
inference(cnf_transformation,[],[f122]) ).
fof(f3650,plain,
~ member(sK0,unordered_pair(sK0,sK1)),
inference(subsumption_resolution,[],[f3644,f231]) ).
fof(f3644,plain,
( ~ member(sK0,unordered_pair(sK0,sK1))
| subclass(singleton(sK0),unordered_pair(sK0,sK1)) ),
inference(superposition,[],[f174,f3639]) ).
fof(f174,plain,
! [X0,X1] :
( ~ member(sK4(X0,X1),X1)
| subclass(X0,X1) ),
inference(cnf_transformation,[],[f102]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET067+1 : TPTP v8.2.0. Bugfixed v5.4.0.
% 0.14/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.35 % Computer : n004.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon May 20 12:14:53 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.22/0.36 % (990)Running in auto input_syntax mode. Trying TPTP
% 0.22/0.39 % (995)WARNING: value z3 for option sas not known
% 0.22/0.39 % (994)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.22/0.39 % (996)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.22/0.39 % (993)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.22/0.39 % (997)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.22/0.39 % (995)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.22/0.39 % (998)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.22/0.39 % (999)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.22/0.43 TRYING [1]
% 0.22/0.43 TRYING [2]
% 0.22/0.44 TRYING [1]
% 0.22/0.44 TRYING [2]
% 0.22/0.47 TRYING [3]
% 0.22/0.47 TRYING [3]
% 1.41/0.55 % (995)First to succeed.
% 1.41/0.56 % (995)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-990"
% 1.41/0.56 % (995)Refutation found. Thanks to Tanya!
% 1.41/0.56 % SZS status Theorem for theBenchmark
% 1.41/0.56 % SZS output start Proof for theBenchmark
% See solution above
% 1.41/0.56 % (995)------------------------------
% 1.41/0.56 % (995)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.41/0.56 % (995)Termination reason: Refutation
% 1.41/0.56
% 1.41/0.56 % (995)Memory used [KB]: 2424
% 1.41/0.56 % (995)Time elapsed: 0.165 s
% 1.41/0.56 % (995)Instructions burned: 244 (million)
% 1.41/0.56 % (990)Success in time 0.193 s
%------------------------------------------------------------------------------