TSTP Solution File: SET108+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SET108+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n007.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 Apr 30 15:05:43 EDT 2024
% Result : Theorem 0.21s 0.38s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 5 unt; 0 def)
% Number of atoms : 90 ( 44 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 112 ( 43 ~; 33 |; 34 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 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 : 44 ( 22 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f245,plain,
$false,
inference(resolution,[],[f244,f233]) ).
fof(f233,plain,
member(sK1,universal_class),
inference(equality_resolution,[],[f232]) ).
fof(f232,plain,
! [X1] :
( sK0 != X1
| member(sK1,universal_class) ),
inference(equality_resolution,[],[f138]) ).
fof(f138,plain,
! [X2,X1] :
( sK0 != X2
| sK0 != X1
| member(sK1,universal_class) ),
inference(cnf_transformation,[],[f88]) ).
fof(f88,plain,
! [X1,X2] :
( ( sK0 != X2
| sK0 != X1
| ( sK0 = ordered_pair(sK1,sK2)
& member(sK2,universal_class)
& member(sK1,universal_class) ) )
& ( ordered_pair(X1,X2) != sK0
| ~ member(X2,universal_class)
| ~ member(X1,universal_class) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f72,f87,f86]) ).
fof(f86,plain,
( ? [X0] :
! [X1,X2] :
( ( X0 != X2
| X0 != X1
| ? [X3,X4] :
( ordered_pair(X3,X4) = X0
& member(X4,universal_class)
& member(X3,universal_class) ) )
& ( ordered_pair(X1,X2) != X0
| ~ member(X2,universal_class)
| ~ member(X1,universal_class) ) )
=> ! [X2,X1] :
( ( sK0 != X2
| sK0 != X1
| ? [X4,X3] :
( ordered_pair(X3,X4) = sK0
& member(X4,universal_class)
& member(X3,universal_class) ) )
& ( ordered_pair(X1,X2) != sK0
| ~ member(X2,universal_class)
| ~ member(X1,universal_class) ) ) ),
introduced(choice_axiom,[]) ).
fof(f87,plain,
( ? [X4,X3] :
( ordered_pair(X3,X4) = sK0
& member(X4,universal_class)
& member(X3,universal_class) )
=> ( sK0 = ordered_pair(sK1,sK2)
& member(sK2,universal_class)
& member(sK1,universal_class) ) ),
introduced(choice_axiom,[]) ).
fof(f72,plain,
? [X0] :
! [X1,X2] :
( ( X0 != X2
| X0 != X1
| ? [X3,X4] :
( ordered_pair(X3,X4) = X0
& member(X4,universal_class)
& member(X3,universal_class) ) )
& ( ordered_pair(X1,X2) != X0
| ~ member(X2,universal_class)
| ~ member(X1,universal_class) ) ),
inference(ennf_transformation,[],[f46]) ).
fof(f46,plain,
~ ! [X0] :
? [X1,X2] :
( ( X0 = X2
& X0 = X1
& ~ ? [X3,X4] :
( ordered_pair(X3,X4) = X0
& member(X4,universal_class)
& member(X3,universal_class) ) )
| ( ordered_pair(X1,X2) = X0
& member(X2,universal_class)
& member(X1,universal_class) ) ),
inference(rectify,[],[f45]) ).
fof(f45,negated_conjecture,
~ ! [X0] :
? [X2,X3] :
( ( X0 = X3
& X0 = X2
& ~ ? [X1,X4] :
( ordered_pair(X1,X4) = X0
& member(X4,universal_class)
& member(X1,universal_class) ) )
| ( ordered_pair(X2,X3) = X0
& member(X3,universal_class)
& member(X2,universal_class) ) ),
inference(negated_conjecture,[],[f44]) ).
fof(f44,conjecture,
! [X0] :
? [X2,X3] :
( ( X0 = X3
& X0 = X2
& ~ ? [X1,X4] :
( ordered_pair(X1,X4) = X0
& member(X4,universal_class)
& member(X1,universal_class) ) )
| ( ordered_pair(X2,X3) = X0
& member(X3,universal_class)
& member(X2,universal_class) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',existence_of_first_and_second) ).
fof(f244,plain,
~ member(sK1,universal_class),
inference(resolution,[],[f243,f231]) ).
fof(f231,plain,
member(sK2,universal_class),
inference(equality_resolution,[],[f230]) ).
fof(f230,plain,
! [X1] :
( sK0 != X1
| member(sK2,universal_class) ),
inference(equality_resolution,[],[f139]) ).
fof(f139,plain,
! [X2,X1] :
( sK0 != X2
| sK0 != X1
| member(sK2,universal_class) ),
inference(cnf_transformation,[],[f88]) ).
fof(f243,plain,
( ~ member(sK2,universal_class)
| ~ member(sK1,universal_class) ),
inference(trivial_inequality_removal,[],[f242]) ).
fof(f242,plain,
( sK0 != sK0
| ~ member(sK2,universal_class)
| ~ member(sK1,universal_class) ),
inference(superposition,[],[f137,f229]) ).
fof(f229,plain,
sK0 = ordered_pair(sK1,sK2),
inference(equality_resolution,[],[f228]) ).
fof(f228,plain,
! [X1] :
( sK0 != X1
| sK0 = ordered_pair(sK1,sK2) ),
inference(equality_resolution,[],[f140]) ).
fof(f140,plain,
! [X2,X1] :
( sK0 != X2
| sK0 != X1
| sK0 = ordered_pair(sK1,sK2) ),
inference(cnf_transformation,[],[f88]) ).
fof(f137,plain,
! [X2,X1] :
( ordered_pair(X1,X2) != sK0
| ~ member(X2,universal_class)
| ~ member(X1,universal_class) ),
inference(cnf_transformation,[],[f88]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SET108+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.04/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.35 % Computer : n007.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 : Tue Apr 30 01:35:32 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.36 % (22070)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.37 % (22074)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.21/0.37 % (22073)WARNING: value z3 for option sas not known
% 0.21/0.37 % (22071)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.21/0.37 % (22073)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.21/0.37 % (22072)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.21/0.37 % (22075)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.21/0.37 % (22076)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.21/0.38 % (22077)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.21/0.38 % (22076)First to succeed.
% 0.21/0.38 % (22075)Also succeeded, but the first one will report.
% 0.21/0.38 % (22076)Refutation found. Thanks to Tanya!
% 0.21/0.38 % SZS status Theorem for theBenchmark
% 0.21/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.38 % (22076)------------------------------
% 0.21/0.38 % (22076)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.21/0.38 % (22076)Termination reason: Refutation
% 0.21/0.38
% 0.21/0.38 % (22076)Memory used [KB]: 951
% 0.21/0.38 % (22076)Time elapsed: 0.007 s
% 0.21/0.38 % (22076)Instructions burned: 9 (million)
% 0.21/0.38 % (22076)------------------------------
% 0.21/0.38 % (22076)------------------------------
% 0.21/0.38 % (22070)Success in time 0.025 s
%------------------------------------------------------------------------------