TSTP Solution File: SET355+4 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SET355+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 : 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:24:32 EDT 2022
% Result : Theorem 0.20s 0.52s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 4 unt; 0 def)
% Number of atoms : 94 ( 0 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 99 ( 35 ~; 28 |; 23 &)
% ( 5 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 69 ( 55 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f107,plain,
$false,
inference(subsumption_resolution,[],[f102,f72]) ).
fof(f72,plain,
~ subset(sK2,sum(sK1)),
inference(cnf_transformation,[],[f42]) ).
fof(f42,plain,
( ~ subset(sK2,sum(sK1))
& member(sK2,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f40,f41]) ).
fof(f41,plain,
( ? [X0,X1] :
( ~ subset(X1,sum(X0))
& member(X1,X0) )
=> ( ~ subset(sK2,sum(sK1))
& member(sK2,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f40,plain,
? [X0,X1] :
( ~ subset(X1,sum(X0))
& member(X1,X0) ),
inference(rectify,[],[f27]) ).
fof(f27,plain,
? [X1,X0] :
( ~ subset(X0,sum(X1))
& member(X0,X1) ),
inference(ennf_transformation,[],[f24]) ).
fof(f24,plain,
~ ! [X1,X0] :
( member(X0,X1)
=> subset(X0,sum(X1)) ),
inference(rectify,[],[f13]) ).
fof(f13,negated_conjecture,
~ ! [X2,X0] :
( member(X2,X0)
=> subset(X2,sum(X0)) ),
inference(negated_conjecture,[],[f12]) ).
fof(f12,conjecture,
! [X2,X0] :
( member(X2,X0)
=> subset(X2,sum(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI43) ).
fof(f102,plain,
subset(sK2,sum(sK1)),
inference(resolution,[],[f99,f71]) ).
fof(f71,plain,
member(sK2,sK1),
inference(cnf_transformation,[],[f42]) ).
fof(f99,plain,
! [X0,X1] :
( ~ member(X0,X1)
| subset(X0,sum(X1)) ),
inference(duplicate_literal_removal,[],[f96]) ).
fof(f96,plain,
! [X0,X1] :
( subset(X0,sum(X1))
| ~ member(X0,X1)
| subset(X0,sum(X1)) ),
inference(resolution,[],[f94,f81]) ).
fof(f81,plain,
! [X0,X1] :
( ~ member(sK4(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f53]) ).
fof(f53,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK4(X0,X1),X1)
& member(sK4(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f51,f52]) ).
fof(f52,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK4(X0,X1),X1)
& member(sK4(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f51,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,[],[f50]) ).
fof(f50,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,[],[f26]) ).
fof(f26,plain,
! [X1,X0] :
( subset(X1,X0)
<=> ! [X2] :
( member(X2,X0)
| ~ member(X2,X1) ) ),
inference(ennf_transformation,[],[f21]) ).
fof(f21,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(f94,plain,
! [X2,X3,X1] :
( member(sK4(X1,X3),sum(X2))
| ~ member(X1,X2)
| subset(X1,X3) ),
inference(resolution,[],[f57,f80]) ).
fof(f80,plain,
! [X0,X1] :
( member(sK4(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f53]) ).
fof(f57,plain,
! [X3,X0,X1] :
( ~ member(X1,X3)
| ~ member(X3,X0)
| member(X1,sum(X0)) ),
inference(cnf_transformation,[],[f31]) ).
fof(f31,plain,
! [X0,X1] :
( ( ( member(X1,sK0(X0,X1))
& member(sK0(X0,X1),X0) )
| ~ member(X1,sum(X0)) )
& ( member(X1,sum(X0))
| ! [X3] :
( ~ member(X1,X3)
| ~ member(X3,X0) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f29,f30]) ).
fof(f30,plain,
! [X0,X1] :
( ? [X2] :
( member(X1,X2)
& member(X2,X0) )
=> ( member(X1,sK0(X0,X1))
& member(sK0(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f29,plain,
! [X0,X1] :
( ( ? [X2] :
( member(X1,X2)
& member(X2,X0) )
| ~ member(X1,sum(X0)) )
& ( member(X1,sum(X0))
| ! [X3] :
( ~ member(X1,X3)
| ~ member(X3,X0) ) ) ),
inference(rectify,[],[f28]) ).
fof(f28,plain,
! [X1,X0] :
( ( ? [X2] :
( member(X0,X2)
& member(X2,X1) )
| ~ member(X0,sum(X1)) )
& ( member(X0,sum(X1))
| ! [X2] :
( ~ member(X0,X2)
| ~ member(X2,X1) ) ) ),
inference(nnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X1,X0] :
( ? [X2] :
( member(X0,X2)
& member(X2,X1) )
<=> member(X0,sum(X1)) ),
inference(rectify,[],[f10]) ).
fof(f10,axiom,
! [X2,X0] :
( member(X2,sum(X0))
<=> ? [X4] :
( member(X4,X0)
& member(X2,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET355+4 : TPTP v8.1.0. Released v2.2.0.
% 0.07/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 13:43:34 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.49 % (29562)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.20/0.49 TRYING [1]
% 0.20/0.50 TRYING [2]
% 0.20/0.50 TRYING [3]
% 0.20/0.50 % (29592)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.51 % (29587)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.20/0.51 % (29577)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 (2999ds/68Mi)
% 0.20/0.51 TRYING [4]
% 0.20/0.51 % (29568)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.20/0.51 % (29587)First to succeed.
% 0.20/0.52 % (29587)Refutation found. Thanks to Tanya!
% 0.20/0.52 % SZS status Theorem for theBenchmark
% 0.20/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.52 % (29587)------------------------------
% 0.20/0.52 % (29587)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (29587)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (29587)Termination reason: Refutation
% 0.20/0.52
% 0.20/0.52 % (29587)Memory used [KB]: 5500
% 0.20/0.52 % (29587)Time elapsed: 0.060 s
% 0.20/0.52 % (29587)Instructions burned: 4 (million)
% 0.20/0.52 % (29587)------------------------------
% 0.20/0.52 % (29587)------------------------------
% 0.20/0.52 % (29561)Success in time 0.163 s
%------------------------------------------------------------------------------