TSTP Solution File: SET912+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SET912+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n019.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 : Wed Aug 31 18:26:04 EDT 2022
% Result : Theorem 0.20s 0.47s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of formulae : 33 ( 15 unt; 0 def)
% Number of atoms : 76 ( 23 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 68 ( 25 ~; 15 |; 22 &)
% ( 1 <=>; 5 =>; 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 : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 51 ( 39 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f93,plain,
$false,
inference(subsumption_resolution,[],[f92,f51]) ).
fof(f51,plain,
sF5 != sF6,
inference(definition_folding,[],[f38,f49,f50,f49]) ).
fof(f50,plain,
set_intersection2(sF5,sK2) = sF6,
introduced(function_definition,[]) ).
fof(f49,plain,
sF5 = unordered_pair(sK1,sK0),
introduced(function_definition,[]) ).
fof(f38,plain,
set_intersection2(unordered_pair(sK1,sK0),sK2) != unordered_pair(sK1,sK0),
inference(cnf_transformation,[],[f25]) ).
fof(f25,plain,
( set_intersection2(unordered_pair(sK1,sK0),sK2) != unordered_pair(sK1,sK0)
& in(sK1,sK2)
& in(sK0,sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f23,f24]) ).
fof(f24,plain,
( ? [X0,X1,X2] :
( unordered_pair(X1,X0) != set_intersection2(unordered_pair(X1,X0),X2)
& in(X1,X2)
& in(X0,X2) )
=> ( set_intersection2(unordered_pair(sK1,sK0),sK2) != unordered_pair(sK1,sK0)
& in(sK1,sK2)
& in(sK0,sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f23,plain,
? [X0,X1,X2] :
( unordered_pair(X1,X0) != set_intersection2(unordered_pair(X1,X0),X2)
& in(X1,X2)
& in(X0,X2) ),
inference(rectify,[],[f21]) ).
fof(f21,plain,
? [X2,X1,X0] :
( unordered_pair(X1,X2) != set_intersection2(unordered_pair(X1,X2),X0)
& in(X1,X0)
& in(X2,X0) ),
inference(flattening,[],[f20]) ).
fof(f20,plain,
? [X1,X2,X0] :
( unordered_pair(X1,X2) != set_intersection2(unordered_pair(X1,X2),X0)
& in(X1,X0)
& in(X2,X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,plain,
~ ! [X1,X2,X0] :
( ( in(X1,X0)
& in(X2,X0) )
=> unordered_pair(X1,X2) = set_intersection2(unordered_pair(X1,X2),X0) ),
inference(rectify,[],[f11]) ).
fof(f11,negated_conjecture,
~ ! [X1,X0,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,
! [X1,X0,X2] :
( ( in(X2,X1)
& in(X0,X1) )
=> unordered_pair(X0,X2) = set_intersection2(unordered_pair(X0,X2),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t53_zfmisc_1) ).
fof(f92,plain,
sF5 = sF6,
inference(backward_demodulation,[],[f50,f91]) ).
fof(f91,plain,
sF5 = set_intersection2(sF5,sK2),
inference(resolution,[],[f35,f86]) ).
fof(f86,plain,
subset(sF5,sK2),
inference(forward_demodulation,[],[f85,f55]) ).
fof(f55,plain,
sF5 = unordered_pair(sK0,sK1),
inference(superposition,[],[f49,f39]) ).
fof(f39,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f16]) ).
fof(f16,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X1,X0] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f85,plain,
subset(unordered_pair(sK0,sK1),sK2),
inference(resolution,[],[f77,f37]) ).
fof(f37,plain,
in(sK1,sK2),
inference(cnf_transformation,[],[f25]) ).
fof(f77,plain,
! [X0] :
( ~ in(X0,sK2)
| subset(unordered_pair(sK0,X0),sK2) ),
inference(resolution,[],[f45,f36]) ).
fof(f36,plain,
in(sK0,sK2),
inference(cnf_transformation,[],[f25]) ).
fof(f45,plain,
! [X2,X0,X1] :
( ~ in(X1,X0)
| subset(unordered_pair(X1,X2),X0)
| ~ in(X2,X0) ),
inference(cnf_transformation,[],[f32]) ).
fof(f32,plain,
! [X0,X1,X2] :
( ( ( in(X1,X0)
& in(X2,X0) )
| ~ subset(unordered_pair(X1,X2),X0) )
& ( subset(unordered_pair(X1,X2),X0)
| ~ in(X1,X0)
| ~ in(X2,X0) ) ),
inference(rectify,[],[f31]) ).
fof(f31,plain,
! [X2,X0,X1] :
( ( ( in(X0,X2)
& in(X1,X2) )
| ~ subset(unordered_pair(X0,X1),X2) )
& ( subset(unordered_pair(X0,X1),X2)
| ~ in(X0,X2)
| ~ in(X1,X2) ) ),
inference(flattening,[],[f30]) ).
fof(f30,plain,
! [X2,X0,X1] :
( ( ( in(X0,X2)
& in(X1,X2) )
| ~ subset(unordered_pair(X0,X1),X2) )
& ( subset(unordered_pair(X0,X1),X2)
| ~ in(X0,X2)
| ~ in(X1,X2) ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f9,axiom,
! [X2,X0,X1] :
( ( in(X0,X2)
& in(X1,X2) )
<=> subset(unordered_pair(X0,X1),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t38_zfmisc_1) ).
fof(f35,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| set_intersection2(X1,X0) = X1 ),
inference(cnf_transformation,[],[f22]) ).
fof(f22,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| set_intersection2(X1,X0) = X1 ),
inference(rectify,[],[f19]) ).
fof(f19,plain,
! [X1,X0] :
( ~ subset(X0,X1)
| set_intersection2(X0,X1) = X0 ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0,X1] :
( subset(X0,X1)
=> set_intersection2(X0,X1) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t28_xboole_1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET912+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.14/0.33 % Computer : n019.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Tue Aug 30 16:33:20 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.45 % (8401)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.20/0.46 % (8393)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.20/0.46 % (8401)First to succeed.
% 0.20/0.47 % (8401)Refutation found. Thanks to Tanya!
% 0.20/0.47 % SZS status Theorem for theBenchmark
% 0.20/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.47 % (8401)------------------------------
% 0.20/0.47 % (8401)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.47 % (8401)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.47 % (8401)Termination reason: Refutation
% 0.20/0.47
% 0.20/0.47 % (8401)Memory used [KB]: 5373
% 0.20/0.47 % (8401)Time elapsed: 0.069 s
% 0.20/0.47 % (8401)Instructions burned: 4 (million)
% 0.20/0.47 % (8401)------------------------------
% 0.20/0.47 % (8401)------------------------------
% 0.20/0.47 % (8372)Success in time 0.122 s
%------------------------------------------------------------------------------