TSTP Solution File: SET072+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SET072+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 : n006.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:27 EDT 2024
% Result : Theorem 0.15s 0.39s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 28 ( 7 unt; 0 def)
% Number of atoms : 89 ( 48 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 86 ( 25 ~; 26 |; 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 : 39 ( 30 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1857,plain,
$false,
inference(trivial_inequality_removal,[],[f1856]) ).
fof(f1856,plain,
sK0 != sK0,
inference(superposition,[],[f140,f1697]) ).
fof(f1697,plain,
sK0 = sK1,
inference(duplicate_literal_removal,[],[f1683]) ).
fof(f1683,plain,
( sK0 = sK1
| sK0 = sK1
| sK0 = sK1 ),
inference(superposition,[],[f1681,f1641]) ).
fof(f1641,plain,
( sK1 = sK2
| sK0 = sK1 ),
inference(resolution,[],[f1631,f138]) ).
fof(f138,plain,
member(sK1,universal_class),
inference(cnf_transformation,[],[f88]) ).
fof(f88,plain,
( sK0 != sK1
& unordered_pair(sK0,sK2) = unordered_pair(sK1,sK2)
& member(sK1,universal_class)
& member(sK0,universal_class) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f73,f87]) ).
fof(f87,plain,
( ? [X0,X1,X2] :
( X0 != X1
& unordered_pair(X0,X2) = unordered_pair(X1,X2)
& member(X1,universal_class)
& member(X0,universal_class) )
=> ( sK0 != sK1
& unordered_pair(sK0,sK2) = unordered_pair(sK1,sK2)
& member(sK1,universal_class)
& member(sK0,universal_class) ) ),
introduced(choice_axiom,[]) ).
fof(f73,plain,
? [X0,X1,X2] :
( X0 != X1
& unordered_pair(X0,X2) = unordered_pair(X1,X2)
& member(X1,universal_class)
& member(X0,universal_class) ),
inference(flattening,[],[f72]) ).
fof(f72,plain,
? [X0,X1,X2] :
( X0 != X1
& unordered_pair(X0,X2) = unordered_pair(X1,X2)
& member(X1,universal_class)
& member(X0,universal_class) ),
inference(ennf_transformation,[],[f46]) ).
fof(f46,plain,
~ ! [X0,X1,X2] :
( ( unordered_pair(X0,X2) = unordered_pair(X1,X2)
& member(X1,universal_class)
& member(X0,universal_class) )
=> X0 = X1 ),
inference(rectify,[],[f45]) ).
fof(f45,negated_conjecture,
~ ! [X0,X1,X4] :
( ( unordered_pair(X0,X4) = unordered_pair(X1,X4)
& member(X1,universal_class)
& member(X0,universal_class) )
=> X0 = X1 ),
inference(negated_conjecture,[],[f44]) ).
fof(f44,conjecture,
! [X0,X1,X4] :
( ( unordered_pair(X0,X4) = unordered_pair(X1,X4)
& member(X1,universal_class)
& member(X0,universal_class) )
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',right_cancellation) ).
fof(f1631,plain,
( ~ member(sK1,universal_class)
| sK1 = sK2
| sK0 = sK1 ),
inference(resolution,[],[f208,f282]) ).
fof(f282,plain,
( member(sK1,unordered_pair(sK0,sK2))
| ~ member(sK1,universal_class) ),
inference(superposition,[],[f233,f139]) ).
fof(f139,plain,
unordered_pair(sK0,sK2) = unordered_pair(sK1,sK2),
inference(cnf_transformation,[],[f88]) ).
fof(f233,plain,
! [X2,X1] :
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
inference(equality_resolution,[],[f209]) ).
fof(f209,plain,
! [X2,X0,X1] :
( member(X0,unordered_pair(X1,X2))
| X0 != X1
| ~ member(X0,universal_class) ),
inference(cnf_transformation,[],[f124]) ).
fof(f124,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,[],[f123]) ).
fof(f123,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,[],[f65]) ).
fof(f65,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(f208,plain,
! [X2,X0,X1] :
( ~ member(X0,unordered_pair(X1,X2))
| X0 = X1
| X0 = X2 ),
inference(cnf_transformation,[],[f124]) ).
fof(f1681,plain,
( sK0 = sK2
| sK0 = sK1 ),
inference(resolution,[],[f1672,f137]) ).
fof(f137,plain,
member(sK0,universal_class),
inference(cnf_transformation,[],[f88]) ).
fof(f1672,plain,
( ~ member(sK0,universal_class)
| sK0 = sK2
| sK0 = sK1 ),
inference(resolution,[],[f1637,f233]) ).
fof(f1637,plain,
! [X0] :
( ~ member(X0,unordered_pair(sK0,sK2))
| sK1 = X0
| sK2 = X0 ),
inference(superposition,[],[f208,f139]) ).
fof(f140,plain,
sK0 != sK1,
inference(cnf_transformation,[],[f88]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SET072+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.02/0.11 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.10/0.31 % Computer : n006.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Apr 30 01:07:35 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.15/0.31 % (14806)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.33 % (14813)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.15/0.33 % (14812)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.15/0.34 % (14808)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.34 % (14807)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.34 % (14811)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.15/0.35 % (14809)WARNING: value z3 for option sas not known
% 0.15/0.35 % (14809)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.15/0.35 % (14810)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.36 TRYING [1]
% 0.15/0.37 TRYING [2]
% 0.15/0.38 TRYING [1]
% 0.15/0.39 TRYING [2]
% 0.15/0.39 % (14812)First to succeed.
% 0.15/0.39 % (14812)Refutation found. Thanks to Tanya!
% 0.15/0.39 % SZS status Theorem for theBenchmark
% 0.15/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.39 % (14812)------------------------------
% 0.15/0.39 % (14812)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.15/0.39 % (14812)Termination reason: Refutation
% 0.15/0.39
% 0.15/0.39 % (14812)Memory used [KB]: 1668
% 0.15/0.39 % (14812)Time elapsed: 0.063 s
% 0.15/0.39 % (14812)Instructions burned: 123 (million)
% 0.15/0.39 % (14812)------------------------------
% 0.15/0.39 % (14812)------------------------------
% 0.15/0.39 % (14806)Success in time 0.08 s
%------------------------------------------------------------------------------