TSTP Solution File: SET912+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET912+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --ignore_missing on --mode portfolio/casc [--schedule casc_hol_2020] -p tptp -om szs -t %d %s
% Computer : n032.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 15:46:17 EDT 2023
% Result : Theorem 0.14s 0.36s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 9 unt; 0 def)
% Number of atoms : 61 ( 19 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 59 ( 23 ~; 14 |; 17 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 42 (; 33 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f75,plain,
$false,
inference(trivial_inequality_removal,[],[f74]) ).
fof(f74,plain,
unordered_pair(sK0,sK2) != unordered_pair(sK0,sK2),
inference(backward_demodulation,[],[f59,f73]) ).
fof(f73,plain,
unordered_pair(sK0,sK2) = set_intersection2(sK1,unordered_pair(sK0,sK2)),
inference(resolution,[],[f70,f27]) ).
fof(f27,plain,
in(sK2,sK1),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
( unordered_pair(sK0,sK2) != set_intersection2(unordered_pair(sK0,sK2),sK1)
& in(sK2,sK1)
& in(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f15,f18]) ).
fof(f18,plain,
( ? [X0,X1,X2] :
( unordered_pair(X0,X2) != set_intersection2(unordered_pair(X0,X2),X1)
& in(X2,X1)
& in(X0,X1) )
=> ( unordered_pair(sK0,sK2) != set_intersection2(unordered_pair(sK0,sK2),sK1)
& in(sK2,sK1)
& in(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
? [X0,X1,X2] :
( unordered_pair(X0,X2) != set_intersection2(unordered_pair(X0,X2),X1)
& in(X2,X1)
& in(X0,X1) ),
inference(flattening,[],[f14]) ).
fof(f14,plain,
? [X0,X1,X2] :
( unordered_pair(X0,X2) != set_intersection2(unordered_pair(X0,X2),X1)
& in(X2,X1)
& in(X0,X1) ),
inference(ennf_transformation,[],[f11]) ).
fof(f11,negated_conjecture,
~ ! [X0,X1,X2] :
( ( in(X2,X1)
& in(X0,X1) )
=> unordered_pair(X0,X2) = set_intersection2(unordered_pair(X0,X2),X1) ),
inference(negated_conjecture,[],[f10]) ).
fof(f10,conjecture,
! [X0,X1,X2] :
( ( in(X2,X1)
& in(X0,X1) )
=> unordered_pair(X0,X2) = set_intersection2(unordered_pair(X0,X2),X1) ),
file('/export/starexec/sandbox2/tmp/tmp.2e0zvnSloX/Vampire---4.8_26861',t53_zfmisc_1) ).
fof(f70,plain,
! [X0] :
( ~ in(X0,sK1)
| unordered_pair(sK0,X0) = set_intersection2(sK1,unordered_pair(sK0,X0)) ),
inference(forward_demodulation,[],[f66,f32]) ).
fof(f32,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
file('/export/starexec/sandbox2/tmp/tmp.2e0zvnSloX/Vampire---4.8_26861',commutativity_k3_xboole_0) ).
fof(f66,plain,
! [X0] :
( ~ in(X0,sK1)
| unordered_pair(sK0,X0) = set_intersection2(unordered_pair(sK0,X0),sK1) ),
inference(resolution,[],[f63,f26]) ).
fof(f26,plain,
in(sK0,sK1),
inference(cnf_transformation,[],[f19]) ).
fof(f63,plain,
! [X8,X6,X7] :
( ~ in(X8,X7)
| ~ in(X6,X7)
| unordered_pair(X8,X6) = set_intersection2(unordered_pair(X8,X6),X7) ),
inference(resolution,[],[f37,f33]) ).
fof(f33,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| set_intersection2(X0,X1) = X0 ),
inference(cnf_transformation,[],[f16]) ).
fof(f16,plain,
! [X0,X1] :
( set_intersection2(X0,X1) = X0
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0,X1] :
( subset(X0,X1)
=> set_intersection2(X0,X1) = X0 ),
file('/export/starexec/sandbox2/tmp/tmp.2e0zvnSloX/Vampire---4.8_26861',t28_xboole_1) ).
fof(f37,plain,
! [X2,X0,X1] :
( subset(unordered_pair(X0,X1),X2)
| ~ in(X1,X2)
| ~ in(X0,X2) ),
inference(cnf_transformation,[],[f21]) ).
fof(f21,plain,
! [X0,X1,X2] :
( ( subset(unordered_pair(X0,X1),X2)
| ~ in(X1,X2)
| ~ in(X0,X2) )
& ( ( in(X1,X2)
& in(X0,X2) )
| ~ subset(unordered_pair(X0,X1),X2) ) ),
inference(flattening,[],[f20]) ).
fof(f20,plain,
! [X0,X1,X2] :
( ( subset(unordered_pair(X0,X1),X2)
| ~ in(X1,X2)
| ~ in(X0,X2) )
& ( ( in(X1,X2)
& in(X0,X2) )
| ~ subset(unordered_pair(X0,X1),X2) ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f9,axiom,
! [X0,X1,X2] :
( subset(unordered_pair(X0,X1),X2)
<=> ( in(X1,X2)
& in(X0,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.2e0zvnSloX/Vampire---4.8_26861',t38_zfmisc_1) ).
fof(f59,plain,
unordered_pair(sK0,sK2) != set_intersection2(sK1,unordered_pair(sK0,sK2)),
inference(superposition,[],[f28,f32]) ).
fof(f28,plain,
unordered_pair(sK0,sK2) != set_intersection2(unordered_pair(sK0,sK2),sK1),
inference(cnf_transformation,[],[f19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SET912+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.11 % Command : vampire --ignore_missing on --mode portfolio/casc [--schedule casc_hol_2020] -p tptp -om szs -t %d %s
% 0.14/0.31 % Computer : n032.cluster.edu
% 0.14/0.31 % Model : x86_64 x86_64
% 0.14/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.31 % Memory : 8042.1875MB
% 0.14/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.31 % CPULimit : 300
% 0.14/0.31 % WCLimit : 300
% 0.14/0.31 % DateTime : Sat Aug 26 10:51:14 EDT 2023
% 0.14/0.31 % CPUTime :
% 0.14/0.31 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.31 Running vampire_casc2023 --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/tmp/tmp.2e0zvnSloX/Vampire---4.8_26861
% 0.14/0.31 % (27039)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.34 % (27040)lrs+10_11_cond=on:drc=off:flr=on:fsr=off:gsp=on:gs=on:gsem=off:lma=on:msp=off:nm=4:nwc=1.5:nicw=on:sas=z3:sims=off:sp=scramble:stl=188_1169 on Vampire---4 for (1169ds/0Mi)
% 0.14/0.36 % (27044)ott+1003_4:1_av=off:cond=on:drc=off:fsd=off:fsr=off:fde=none:gsp=on:nm=2:nwc=1.5:sos=all:sp=reverse_arity:tgt=full_871 on Vampire---4 for (871ds/0Mi)
% 0.14/0.36 % (27043)lrs+3_20_av=off:bd=preordered:drc=off:fsd=off:fsr=off:fde=unused:irw=on:lcm=reverse:sos=theory:stl=315_961 on Vampire---4 for (961ds/0Mi)
% 0.14/0.36 % (27046)ott+11_14_av=off:bs=on:bsr=on:cond=on:flr=on:fsd=off:fde=unused:gsp=on:nm=4:nwc=1.5:tgt=full_501 on Vampire---4 for (501ds/0Mi)
% 0.14/0.36 % (27045)lrs-11_32_av=off:bd=off:bs=on:bsr=on:drc=off:flr=on:fsd=off:fsr=off:fde=none:gsp=on:irw=on:lcm=predicate:nm=4:sp=scramble:stl=125_825 on Vampire---4 for (825ds/0Mi)
% 0.14/0.36 % (27043)First to succeed.
% 0.14/0.36 % (27044)Also succeeded, but the first one will report.
% 0.14/0.36 % (27045)Also succeeded, but the first one will report.
% 0.14/0.36 % (27043)Refutation found. Thanks to Tanya!
% 0.14/0.36 % SZS status Theorem for Vampire---4
% 0.14/0.36 % SZS output start Proof for Vampire---4
% See solution above
% 0.14/0.36 % (27043)------------------------------
% 0.14/0.36 % (27043)Version: Vampire 4.7 (commit 05ef610bd on 2023-06-21 19:03:17 +0100)
% 0.14/0.36 % (27043)Linked with Z3 4.9.1.0 6ed071b44407cf6623b8d3c0dceb2a8fb7040cee z3-4.8.4-6427-g6ed071b44
% 0.14/0.36 % (27043)Termination reason: Refutation
% 0.14/0.36
% 0.14/0.36 % (27043)Memory used [KB]: 895
% 0.14/0.36 % (27043)Time elapsed: 0.004 s
% 0.14/0.36 % (27043)------------------------------
% 0.14/0.36 % (27043)------------------------------
% 0.14/0.36 % (27039)Success in time 0.049 s
% 0.14/0.36 % Vampire---4.8 exiting
%------------------------------------------------------------------------------