TSTP Solution File: SET704+4 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SET704+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 : n005.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:24 EDT 2022
% Result : Theorem 0.20s 0.50s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 34 ( 6 unt; 0 def)
% Number of atoms : 100 ( 1 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 105 ( 39 ~; 29 |; 21 &)
% ( 6 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 69 ( 57 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f381,plain,
$false,
inference(subsumption_resolution,[],[f380,f90]) ).
fof(f90,plain,
~ subset(sF5,sK2),
inference(definition_folding,[],[f73,f89]) ).
fof(f89,plain,
sF5 = product(sK1),
introduced(function_definition,[]) ).
fof(f73,plain,
~ subset(product(sK1),sK2),
inference(cnf_transformation,[],[f44]) ).
fof(f44,plain,
( ~ subset(product(sK1),sK2)
& member(sK2,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f42,f43]) ).
fof(f43,plain,
( ? [X0,X1] :
( ~ subset(product(X0),X1)
& member(X1,X0) )
=> ( ~ subset(product(sK1),sK2)
& member(sK2,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f42,plain,
? [X0,X1] :
( ~ subset(product(X0),X1)
& member(X1,X0) ),
inference(rectify,[],[f26]) ).
fof(f26,plain,
? [X1,X0] :
( ~ subset(product(X1),X0)
& member(X0,X1) ),
inference(ennf_transformation,[],[f25]) ).
fof(f25,plain,
~ ! [X0,X1] :
( member(X0,X1)
=> subset(product(X1),X0) ),
inference(rectify,[],[f13]) ).
fof(f13,negated_conjecture,
~ ! [X2,X0] :
( member(X2,X0)
=> subset(product(X0),X2) ),
inference(negated_conjecture,[],[f12]) ).
fof(f12,conjecture,
! [X2,X0] :
( member(X2,X0)
=> subset(product(X0),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI42) ).
fof(f380,plain,
subset(sF5,sK2),
inference(duplicate_literal_removal,[],[f377]) ).
fof(f377,plain,
( subset(sF5,sK2)
| subset(sF5,sK2) ),
inference(resolution,[],[f374,f60]) ).
fof(f60,plain,
! [X0,X1] :
( ~ member(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f32]) ).
fof(f32,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f30,f31]) ).
fof(f31,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f30,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f29]) ).
fof(f29,plain,
! [X1,X0] :
( ( subset(X1,X0)
| ? [X2] :
( ~ member(X2,X0)
& member(X2,X1) ) )
& ( ! [X2] :
( member(X2,X0)
| ~ member(X2,X1) )
| ~ subset(X1,X0) ) ),
inference(nnf_transformation,[],[f28]) ).
fof(f28,plain,
! [X1,X0] :
( subset(X1,X0)
<=> ! [X2] :
( member(X2,X0)
| ~ member(X2,X1) ) ),
inference(ennf_transformation,[],[f18]) ).
fof(f18,plain,
! [X1,X0] :
( ! [X2] :
( member(X2,X1)
=> member(X2,X0) )
<=> subset(X1,X0) ),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
! [X1,X0] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset) ).
fof(f374,plain,
! [X0] :
( member(sK0(sF5,X0),sK2)
| subset(sF5,X0) ),
inference(resolution,[],[f370,f59]) ).
fof(f59,plain,
! [X0,X1] :
( member(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f32]) ).
fof(f370,plain,
! [X2] :
( ~ member(X2,sF5)
| member(X2,sK2) ),
inference(resolution,[],[f368,f72]) ).
fof(f72,plain,
member(sK2,sK1),
inference(cnf_transformation,[],[f44]) ).
fof(f368,plain,
! [X0,X1] :
( ~ member(X1,sK1)
| member(X0,X1)
| ~ member(X0,sF5) ),
inference(superposition,[],[f79,f89]) ).
fof(f79,plain,
! [X2,X0,X1] :
( ~ member(X1,product(X0))
| ~ member(X2,X0)
| member(X1,X2) ),
inference(cnf_transformation,[],[f52]) ).
fof(f52,plain,
! [X0,X1] :
( ( ! [X2] :
( member(X1,X2)
| ~ member(X2,X0) )
| ~ member(X1,product(X0)) )
& ( member(X1,product(X0))
| ( ~ member(X1,sK4(X0,X1))
& member(sK4(X0,X1),X0) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f50,f51]) ).
fof(f51,plain,
! [X0,X1] :
( ? [X3] :
( ~ member(X1,X3)
& member(X3,X0) )
=> ( ~ member(X1,sK4(X0,X1))
& member(sK4(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f50,plain,
! [X0,X1] :
( ( ! [X2] :
( member(X1,X2)
| ~ member(X2,X0) )
| ~ member(X1,product(X0)) )
& ( member(X1,product(X0))
| ? [X3] :
( ~ member(X1,X3)
& member(X3,X0) ) ) ),
inference(rectify,[],[f49]) ).
fof(f49,plain,
! [X1,X0] :
( ( ! [X2] :
( member(X0,X2)
| ~ member(X2,X1) )
| ~ member(X0,product(X1)) )
& ( member(X0,product(X1))
| ? [X2] :
( ~ member(X0,X2)
& member(X2,X1) ) ) ),
inference(nnf_transformation,[],[f27]) ).
fof(f27,plain,
! [X1,X0] :
( ! [X2] :
( member(X0,X2)
| ~ member(X2,X1) )
<=> member(X0,product(X1)) ),
inference(ennf_transformation,[],[f21]) ).
fof(f21,plain,
! [X0,X1] :
( member(X0,product(X1))
<=> ! [X2] :
( member(X2,X1)
=> member(X0,X2) ) ),
inference(rectify,[],[f11]) ).
fof(f11,axiom,
! [X2,X0] :
( ! [X4] :
( member(X4,X0)
=> member(X2,X4) )
<=> member(X2,product(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET704+4 : TPTP v8.1.0. Released v2.2.0.
% 0.13/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.13/0.34 % Computer : n005.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 30 14:27:03 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.47 % (18968)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 % (18981)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.20/0.49 % (18973)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.20/0.49 % (18968)First to succeed.
% 0.20/0.50 TRYING [1]
% 0.20/0.50 TRYING [2]
% 0.20/0.50 TRYING [3]
% 0.20/0.50 % (18968)Refutation found. Thanks to Tanya!
% 0.20/0.50 % SZS status Theorem for theBenchmark
% 0.20/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.50 % (18968)------------------------------
% 0.20/0.50 % (18968)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50 % (18968)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50 % (18968)Termination reason: Refutation
% 0.20/0.50
% 0.20/0.50 % (18968)Memory used [KB]: 5628
% 0.20/0.50 % (18968)Time elapsed: 0.098 s
% 0.20/0.50 % (18968)Instructions burned: 12 (million)
% 0.20/0.50 % (18968)------------------------------
% 0.20/0.50 % (18968)------------------------------
% 0.20/0.50 % (18955)Success in time 0.154 s
%------------------------------------------------------------------------------