TSTP Solution File: SET987+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SET987+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 : n001.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:16 EDT 2022
% Result : Theorem 0.20s 0.49s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 23 ( 14 unt; 0 def)
% Number of atoms : 34 ( 22 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 27 ( 16 ~; 2 |; 4 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 20 ( 16 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f68,plain,
$false,
inference(subsumption_resolution,[],[f67,f42]) ).
fof(f42,plain,
sK1 != sF6,
inference(definition_folding,[],[f29,f41,f39,f40,f39]) ).
fof(f40,plain,
set_union2(sK1,sF4) = sF5,
introduced(function_definition,[]) ).
fof(f39,plain,
sF4 = singleton(sK0),
introduced(function_definition,[]) ).
fof(f41,plain,
set_difference(sF5,sF4) = sF6,
introduced(function_definition,[]) ).
fof(f29,plain,
set_difference(set_union2(sK1,singleton(sK0)),singleton(sK0)) != sK1,
inference(cnf_transformation,[],[f21]) ).
fof(f21,plain,
( set_difference(set_union2(sK1,singleton(sK0)),singleton(sK0)) != sK1
& ~ in(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f15,f20]) ).
fof(f20,plain,
( ? [X0,X1] :
( set_difference(set_union2(X1,singleton(X0)),singleton(X0)) != X1
& ~ in(X0,X1) )
=> ( set_difference(set_union2(sK1,singleton(sK0)),singleton(sK0)) != sK1
& ~ in(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
? [X0,X1] :
( set_difference(set_union2(X1,singleton(X0)),singleton(X0)) != X1
& ~ in(X0,X1) ),
inference(ennf_transformation,[],[f9]) ).
fof(f9,negated_conjecture,
~ ! [X0,X1] :
( ~ in(X0,X1)
=> set_difference(set_union2(X1,singleton(X0)),singleton(X0)) = X1 ),
inference(negated_conjecture,[],[f8]) ).
fof(f8,conjecture,
! [X0,X1] :
( ~ in(X0,X1)
=> set_difference(set_union2(X1,singleton(X0)),singleton(X0)) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t141_zfmisc_1) ).
fof(f67,plain,
sK1 = sF6,
inference(forward_demodulation,[],[f66,f62]) ).
fof(f62,plain,
set_difference(sK1,sF4) = sK1,
inference(forward_demodulation,[],[f60,f39]) ).
fof(f60,plain,
sK1 = set_difference(sK1,singleton(sK0)),
inference(resolution,[],[f35,f28]) ).
fof(f28,plain,
~ in(sK0,sK1),
inference(cnf_transformation,[],[f21]) ).
fof(f35,plain,
! [X0,X1] :
( in(X1,X0)
| set_difference(X0,singleton(X1)) = X0 ),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
! [X0,X1] :
( set_difference(X0,singleton(X1)) = X0
| in(X1,X0) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,plain,
! [X0,X1] :
( ~ in(X1,X0)
=> set_difference(X0,singleton(X1)) = X0 ),
inference(unused_predicate_definition_removal,[],[f11]) ).
fof(f11,axiom,
! [X0,X1] :
( set_difference(X0,singleton(X1)) = X0
<=> ~ in(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t65_zfmisc_1) ).
fof(f66,plain,
set_difference(sK1,sF4) = sF6,
inference(forward_demodulation,[],[f65,f41]) ).
fof(f65,plain,
set_difference(sK1,sF4) = set_difference(sF5,sF4),
inference(superposition,[],[f38,f40]) ).
fof(f38,plain,
! [X0,X1] : set_difference(set_union2(X0,X1),X1) = set_difference(X0,X1),
inference(cnf_transformation,[],[f10]) ).
fof(f10,axiom,
! [X0,X1] : set_difference(set_union2(X0,X1),X1) = set_difference(X0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t40_xboole_1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET987+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/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 : n001.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:55:16 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.49 % (820)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.49 % (820)First to succeed.
% 0.20/0.49 % (820)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 % (820)------------------------------
% 0.20/0.49 % (820)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.49 % (820)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.49 % (820)Termination reason: Refutation
% 0.20/0.49
% 0.20/0.49 % (820)Memory used [KB]: 5373
% 0.20/0.49 % (820)Time elapsed: 0.091 s
% 0.20/0.49 % (820)Instructions burned: 2 (million)
% 0.20/0.49 % (820)------------------------------
% 0.20/0.49 % (820)------------------------------
% 0.20/0.49 % (807)Success in time 0.139 s
%------------------------------------------------------------------------------