TSTP Solution File: SET767+4 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SET767+4 : TPTP v8.1.0. Released v2.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 : n025.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:25:35 EDT 2022
% Result : Theorem 0.20s 0.49s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 29 ( 5 unt; 0 def)
% Number of atoms : 85 ( 1 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 89 ( 33 ~; 25 |; 21 &)
% ( 4 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-3 aty)
% Number of variables : 68 ( 56 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f141,plain,
$false,
inference(subsumption_resolution,[],[f140,f110]) ).
fof(f110,plain,
~ subset(sF6,sK1),
inference(definition_folding,[],[f82,f109]) ).
fof(f109,plain,
sF6 = equivalence_class(sK3,sK1,sK2),
introduced(function_definition,[]) ).
fof(f82,plain,
~ subset(equivalence_class(sK3,sK1,sK2),sK1),
inference(cnf_transformation,[],[f50]) ).
fof(f50,plain,
( equivalence(sK2,sK1)
& ~ subset(equivalence_class(sK3,sK1,sK2),sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f48,f49]) ).
fof(f49,plain,
( ? [X0,X1,X2] :
( equivalence(X1,X0)
& ~ subset(equivalence_class(X2,X0,X1),X0) )
=> ( equivalence(sK2,sK1)
& ~ subset(equivalence_class(sK3,sK1,sK2),sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f48,plain,
? [X0,X1,X2] :
( equivalence(X1,X0)
& ~ subset(equivalence_class(X2,X0,X1),X0) ),
inference(rectify,[],[f35]) ).
fof(f35,plain,
? [X1,X2,X0] :
( equivalence(X2,X1)
& ~ subset(equivalence_class(X0,X1,X2),X1) ),
inference(ennf_transformation,[],[f24]) ).
fof(f24,plain,
~ ! [X2,X0,X1] :
( equivalence(X2,X1)
=> subset(equivalence_class(X0,X1,X2),X1) ),
inference(rectify,[],[f18]) ).
fof(f18,negated_conjecture,
~ ! [X0,X3,X6] :
( equivalence(X6,X3)
=> subset(equivalence_class(X0,X3,X6),X3) ),
inference(negated_conjecture,[],[f17]) ).
fof(f17,conjecture,
! [X0,X3,X6] :
( equivalence(X6,X3)
=> subset(equivalence_class(X0,X3,X6),X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thIII03) ).
fof(f140,plain,
subset(sF6,sK1),
inference(duplicate_literal_removal,[],[f138]) ).
fof(f138,plain,
( subset(sF6,sK1)
| subset(sF6,sK1) ),
inference(resolution,[],[f137,f76]) ).
fof(f76,plain,
! [X0,X1] :
( ~ member(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f44]) ).
fof(f44,plain,
! [X0,X1] :
( ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f42,f43]) ).
fof(f43,plain,
! [X0,X1] :
( ? [X3] :
( ~ member(X3,X1)
& member(X3,X0) )
=> ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f42,plain,
! [X0,X1] :
( ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ? [X3] :
( ~ member(X3,X1)
& member(X3,X0) ) ) ),
inference(rectify,[],[f41]) ).
fof(f41,plain,
! [X0,X1] :
( ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) ) ),
inference(nnf_transformation,[],[f33]) ).
fof(f33,plain,
! [X0,X1] :
( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
<=> subset(X0,X1) ),
inference(ennf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset) ).
fof(f137,plain,
! [X0] :
( member(sK0(sF6,X0),sK1)
| subset(sF6,X0) ),
inference(resolution,[],[f136,f75]) ).
fof(f75,plain,
! [X0,X1] :
( member(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f44]) ).
fof(f136,plain,
! [X0] :
( ~ member(X0,sF6)
| member(X0,sK1) ),
inference(superposition,[],[f80,f109]) ).
fof(f80,plain,
! [X2,X3,X0,X1] :
( ~ member(X1,equivalence_class(X3,X0,X2))
| member(X1,X0) ),
inference(cnf_transformation,[],[f47]) ).
fof(f47,plain,
! [X0,X1,X2,X3] :
( ( ( apply(X2,X3,X1)
& member(X1,X0) )
| ~ member(X1,equivalence_class(X3,X0,X2)) )
& ( member(X1,equivalence_class(X3,X0,X2))
| ~ apply(X2,X3,X1)
| ~ member(X1,X0) ) ),
inference(rectify,[],[f46]) ).
fof(f46,plain,
! [X3,X1,X0,X2] :
( ( ( apply(X0,X2,X1)
& member(X1,X3) )
| ~ member(X1,equivalence_class(X2,X3,X0)) )
& ( member(X1,equivalence_class(X2,X3,X0))
| ~ apply(X0,X2,X1)
| ~ member(X1,X3) ) ),
inference(flattening,[],[f45]) ).
fof(f45,plain,
! [X3,X1,X0,X2] :
( ( ( apply(X0,X2,X1)
& member(X1,X3) )
| ~ member(X1,equivalence_class(X2,X3,X0)) )
& ( member(X1,equivalence_class(X2,X3,X0))
| ~ apply(X0,X2,X1)
| ~ member(X1,X3) ) ),
inference(nnf_transformation,[],[f30]) ).
fof(f30,plain,
! [X3,X1,X0,X2] :
( ( apply(X0,X2,X1)
& member(X1,X3) )
<=> member(X1,equivalence_class(X2,X3,X0)) ),
inference(rectify,[],[f15]) ).
fof(f15,axiom,
! [X6,X2,X0,X3] :
( member(X2,equivalence_class(X0,X3,X6))
<=> ( apply(X6,X0,X2)
& member(X2,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equivalence_class) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SET767+4 : TPTP v8.1.0. Released v2.2.0.
% 0.10/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 30 14:26:00 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.48 % (6934)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.20/0.48 % (6934)First to succeed.
% 0.20/0.49 % (6934)Refutation found. Thanks to Tanya!
% 0.20/0.49 % SZS status Theorem for theBenchmark
% 0.20/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.49 % (6934)------------------------------
% 0.20/0.49 % (6934)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.49 % (6934)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.49 % (6934)Termination reason: Refutation
% 0.20/0.49
% 0.20/0.49 % (6934)Memory used [KB]: 5500
% 0.20/0.49 % (6934)Time elapsed: 0.090 s
% 0.20/0.49 % (6934)Instructions burned: 5 (million)
% 0.20/0.49 % (6934)------------------------------
% 0.20/0.49 % (6934)------------------------------
% 0.20/0.49 % (6921)Success in time 0.142 s
%------------------------------------------------------------------------------