TSTP Solution File: SET899+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SET899+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 : n024.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:02 EDT 2022
% Result : Theorem 0.20s 0.48s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 8 unt; 0 def)
% Number of atoms : 55 ( 2 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 53 ( 21 ~; 17 |; 10 &)
% ( 0 <=>; 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 : 36 ( 27 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f39,plain,
$false,
inference(subsumption_resolution,[],[f38,f33]) ).
fof(f33,plain,
~ subset(sK2,sF6),
inference(definition_folding,[],[f27,f32,f31]) ).
fof(f31,plain,
sF5 = singleton(sK3),
introduced(function_definition,[]) ).
fof(f32,plain,
sF6 = set_difference(sK4,sF5),
introduced(function_definition,[]) ).
fof(f27,plain,
~ subset(sK2,set_difference(sK4,singleton(sK3))),
inference(cnf_transformation,[],[f22]) ).
fof(f22,plain,
( ~ in(sK3,sK2)
& subset(sK2,sK4)
& ~ subset(sK2,set_difference(sK4,singleton(sK3))) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f14,f21]) ).
fof(f21,plain,
( ? [X0,X1,X2] :
( ~ in(X1,X0)
& subset(X0,X2)
& ~ subset(X0,set_difference(X2,singleton(X1))) )
=> ( ~ in(sK3,sK2)
& subset(sK2,sK4)
& ~ subset(sK2,set_difference(sK4,singleton(sK3))) ) ),
introduced(choice_axiom,[]) ).
fof(f14,plain,
? [X0,X1,X2] :
( ~ in(X1,X0)
& subset(X0,X2)
& ~ subset(X0,set_difference(X2,singleton(X1))) ),
inference(flattening,[],[f13]) ).
fof(f13,plain,
? [X0,X1,X2] :
( ~ in(X1,X0)
& ~ subset(X0,set_difference(X2,singleton(X1)))
& subset(X0,X2) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,plain,
~ ! [X0,X1,X2] :
( subset(X0,X2)
=> ( in(X1,X0)
| subset(X0,set_difference(X2,singleton(X1))) ) ),
inference(rectify,[],[f6]) ).
fof(f6,negated_conjecture,
~ ! [X0,X2,X1] :
( subset(X0,X1)
=> ( subset(X0,set_difference(X1,singleton(X2)))
| in(X2,X0) ) ),
inference(negated_conjecture,[],[f5]) ).
fof(f5,conjecture,
! [X0,X2,X1] :
( subset(X0,X1)
=> ( subset(X0,set_difference(X1,singleton(X2)))
| in(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t40_zfmisc_1) ).
fof(f38,plain,
subset(sK2,sF6),
inference(subsumption_resolution,[],[f36,f29]) ).
fof(f29,plain,
~ in(sK3,sK2),
inference(cnf_transformation,[],[f22]) ).
fof(f36,plain,
( in(sK3,sK2)
| subset(sK2,sF6) ),
inference(resolution,[],[f35,f28]) ).
fof(f28,plain,
subset(sK2,sK4),
inference(cnf_transformation,[],[f22]) ).
fof(f35,plain,
! [X0] :
( ~ subset(X0,sK4)
| subset(X0,sF6)
| in(sK3,X0) ),
inference(superposition,[],[f34,f32]) ).
fof(f34,plain,
! [X0,X1] :
( subset(X0,set_difference(X1,sF5))
| in(sK3,X0)
| ~ subset(X0,X1) ),
inference(superposition,[],[f26,f31]) ).
fof(f26,plain,
! [X2,X0,X1] :
( subset(X2,set_difference(X0,singleton(X1)))
| in(X1,X2)
| ~ subset(X2,X0) ),
inference(cnf_transformation,[],[f20]) ).
fof(f20,plain,
! [X0,X1,X2] :
( subset(X2,set_difference(X0,singleton(X1)))
| ~ subset(X2,X0)
| in(X1,X2) ),
inference(rectify,[],[f12]) ).
fof(f12,plain,
! [X1,X2,X0] :
( subset(X0,set_difference(X1,singleton(X2)))
| ~ subset(X0,X1)
| in(X2,X0) ),
inference(flattening,[],[f11]) ).
fof(f11,plain,
! [X1,X2,X0] :
( in(X2,X0)
| subset(X0,set_difference(X1,singleton(X2)))
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X1,X2,X0] :
( subset(X0,X1)
=> ( in(X2,X0)
| subset(X0,set_difference(X1,singleton(X2))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l3_zfmisc_1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET899+1 : TPTP v8.1.0. Released v3.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 : n024.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:31:04 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.47 % (25932)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/100Mi)
% 0.20/0.47 % (25939)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/100Mi)
% 0.20/0.47 % (25939)First to succeed.
% 0.20/0.48 % (25947)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/68Mi)
% 0.20/0.48 % (25939)Refutation found. Thanks to Tanya!
% 0.20/0.48 % SZS status Theorem for theBenchmark
% 0.20/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.48 % (25939)------------------------------
% 0.20/0.48 % (25939)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.48 % (25939)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.48 % (25939)Termination reason: Refutation
% 0.20/0.48
% 0.20/0.48 % (25939)Memory used [KB]: 5373
% 0.20/0.48 % (25939)Time elapsed: 0.086 s
% 0.20/0.48 % (25939)Instructions burned: 2 (million)
% 0.20/0.48 % (25939)------------------------------
% 0.20/0.48 % (25939)------------------------------
% 0.20/0.48 % (25920)Success in time 0.136 s
%------------------------------------------------------------------------------