TSTP Solution File: SET912+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---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 : n026.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 : Sat Sep 2 00:03:29 EDT 2023
% Result : Theorem 0.23s 0.44s
% Output : Refutation 0.23s
% 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(f83,plain,
$false,
inference(trivial_inequality_removal,[],[f82]) ).
fof(f82,plain,
unordered_pair(sK0,sK2) != unordered_pair(sK0,sK2),
inference(superposition,[],[f45,f81]) ).
fof(f81,plain,
unordered_pair(sK0,sK2) = set_intersection2(sK1,unordered_pair(sK0,sK2)),
inference(resolution,[],[f76,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.bdRDwPMneq/Vampire---4.8_1602',t53_zfmisc_1) ).
fof(f76,plain,
! [X0] :
( ~ in(X0,sK1)
| unordered_pair(sK0,X0) = set_intersection2(sK1,unordered_pair(sK0,X0)) ),
inference(forward_demodulation,[],[f67,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.bdRDwPMneq/Vampire---4.8_1602',commutativity_k3_xboole_0) ).
fof(f67,plain,
! [X0] :
( ~ in(X0,sK1)
| unordered_pair(sK0,X0) = set_intersection2(unordered_pair(sK0,X0),sK1) ),
inference(resolution,[],[f64,f26]) ).
fof(f26,plain,
in(sK0,sK1),
inference(cnf_transformation,[],[f19]) ).
fof(f64,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.bdRDwPMneq/Vampire---4.8_1602',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.bdRDwPMneq/Vampire---4.8_1602',t38_zfmisc_1) ).
fof(f45,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.13 % Problem : SET912+1 : TPTP v8.1.2. Released v3.2.0.
% 0.15/0.15 % Command : vampire --ignore_missing on --mode portfolio/casc [--schedule casc_hol_2020] -p tptp -om szs -t %d %s
% 0.15/0.37 % Computer : n026.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Wed Aug 30 15:58:06 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.23/0.43 % (2003)Running in auto input_syntax mode. Trying TPTP
% 0.23/0.43 % (2012)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on Vampire---4 for (846ds/0Mi)
% 0.23/0.43 % (2013)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on Vampire---4 for (793ds/0Mi)
% 0.23/0.43 % (2015)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on Vampire---4 for (533ds/0Mi)
% 0.23/0.43 % (2014)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 Vampire---4 for (569ds/0Mi)
% 0.23/0.43 % (2016)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 Vampire---4 for (531ds/0Mi)
% 0.23/0.43 % (2017)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 Vampire---4 for (522ds/0Mi)
% 0.23/0.43 % (2018)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 Vampire---4 for (497ds/0Mi)
% 0.23/0.43 TRYING [1]
% 0.23/0.43 TRYING [2]
% 0.23/0.44 TRYING [3]
% 0.23/0.44 TRYING [1]
% 0.23/0.44 TRYING [2]
% 0.23/0.44 TRYING [4]
% 0.23/0.44 % (2017)First to succeed.
% 0.23/0.44 TRYING [1]
% 0.23/0.44 % (2018)Also succeeded, but the first one will report.
% 0.23/0.44 TRYING [2]
% 0.23/0.44 TRYING [3]
% 0.23/0.44 TRYING [3]
% 0.23/0.44 % (2016)Also succeeded, but the first one will report.
% 0.23/0.44 % (2017)Refutation found. Thanks to Tanya!
% 0.23/0.44 % SZS status Theorem for Vampire---4
% 0.23/0.44 % SZS output start Proof for Vampire---4
% See solution above
% 0.23/0.44 % (2017)------------------------------
% 0.23/0.44 % (2017)Version: Vampire 4.7 (commit 05ef610bd on 2023-06-21 19:03:17 +0100)
% 0.23/0.44 % (2017)Linked with Z3 4.9.1.0 6ed071b44407cf6623b8d3c0dceb2a8fb7040cee z3-4.8.4-6427-g6ed071b44
% 0.23/0.44 % (2017)Termination reason: Refutation
% 0.23/0.44
% 0.23/0.44 % (2017)Memory used [KB]: 895
% 0.23/0.44 % (2017)Time elapsed: 0.005 s
% 0.23/0.44 % (2017)------------------------------
% 0.23/0.44 % (2017)------------------------------
% 0.23/0.44 % (2003)Success in time 0.064 s
% 0.23/0.44 % Vampire---4.8 exiting
%------------------------------------------------------------------------------