TSTP Solution File: NUM383+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : NUM383+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 : n017.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:04:57 EDT 2022
% Result : Theorem 0.16s 0.49s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 48 ( 7 unt; 3 typ; 0 def)
% Number of atoms : 104 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 102 ( 43 ~; 37 |; 13 &)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 4 ( 0 usr; 3 ari)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 82 ( 76 !; 6 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_11,type,
sQ14_eqProxy: ( $int * $int ) > $o ).
tff(pred_def_12,type,
sQ15_eqProxy: ( $rat * $rat ) > $o ).
tff(pred_def_13,type,
sQ16_eqProxy: ( $real * $real ) > $o ).
fof(f244,plain,
$false,
inference(subsumption_resolution,[],[f241,f162]) ).
fof(f162,plain,
! [X0,X1] :
( ~ in(X1,X0)
| ~ in(X0,X1) ),
inference(literal_reordering,[],[f126]) ).
fof(f126,plain,
! [X0,X1] :
( ~ in(X0,X1)
| ~ in(X1,X0) ),
inference(cnf_transformation,[],[f56]) ).
fof(f56,plain,
! [X0,X1] :
( ~ in(X1,X0)
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] :
( in(X0,X1)
=> ~ in(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
fof(f241,plain,
in(sK11,sK11),
inference(resolution,[],[f230,f213]) ).
fof(f213,plain,
element(sK10,powerset(sK11)),
inference(resolution,[],[f166,f132]) ).
fof(f132,plain,
subset(sK10,sK11),
inference(literal_reordering,[],[f123]) ).
fof(f123,plain,
subset(sK10,sK11),
inference(cnf_transformation,[],[f84]) ).
fof(f84,plain,
( in(sK11,sK10)
& subset(sK10,sK11) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK10,sK11])],[f82,f83]) ).
fof(f83,plain,
( ? [X0,X1] :
( in(X1,X0)
& subset(X0,X1) )
=> ( in(sK11,sK10)
& subset(sK10,sK11) ) ),
introduced(choice_axiom,[]) ).
fof(f82,plain,
? [X0,X1] :
( in(X1,X0)
& subset(X0,X1) ),
inference(rectify,[],[f48]) ).
fof(f48,plain,
? [X1,X0] :
( in(X0,X1)
& subset(X1,X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f28,negated_conjecture,
~ ! [X1,X0] :
~ ( in(X0,X1)
& subset(X1,X0) ),
inference(negated_conjecture,[],[f27]) ).
fof(f27,conjecture,
! [X1,X0] :
~ ( in(X0,X1)
& subset(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_ordinal1) ).
fof(f166,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| element(X1,powerset(X0)) ),
inference(literal_reordering,[],[f121]) ).
fof(f121,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| element(X1,powerset(X0)) ),
inference(cnf_transformation,[],[f55]) ).
fof(f55,plain,
! [X0,X1] :
( element(X1,powerset(X0))
| ~ subset(X1,X0) ),
inference(ennf_transformation,[],[f36]) ).
fof(f36,plain,
! [X0,X1] :
( subset(X1,X0)
=> element(X1,powerset(X0)) ),
inference(unused_predicate_definition_removal,[],[f30]) ).
fof(f30,plain,
! [X0,X1] :
( element(X1,powerset(X0))
<=> subset(X1,X0) ),
inference(rectify,[],[f22]) ).
fof(f22,axiom,
! [X1,X0] :
( element(X0,powerset(X1))
<=> subset(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_subset) ).
fof(f230,plain,
! [X0] :
( ~ element(sK10,powerset(X0))
| in(sK11,X0) ),
inference(subsumption_resolution,[],[f229,f218]) ).
fof(f218,plain,
! [X0] :
( ~ empty(X0)
| ~ element(sK10,powerset(X0)) ),
inference(resolution,[],[f133,f157]) ).
fof(f157,plain,
in(sK11,sK10),
inference(literal_reordering,[],[f124]) ).
fof(f124,plain,
in(sK11,sK10),
inference(cnf_transformation,[],[f84]) ).
fof(f133,plain,
! [X2,X0,X1] :
( ~ in(X2,X1)
| ~ element(X1,powerset(X0))
| ~ empty(X0) ),
inference(literal_reordering,[],[f120]) ).
fof(f120,plain,
! [X2,X0,X1] :
( ~ in(X2,X1)
| ~ element(X1,powerset(X0))
| ~ empty(X0) ),
inference(cnf_transformation,[],[f44]) ).
fof(f44,plain,
! [X0,X1,X2] :
( ~ in(X2,X1)
| ~ empty(X0)
| ~ element(X1,powerset(X0)) ),
inference(ennf_transformation,[],[f33]) ).
fof(f33,plain,
! [X2,X1,X0] :
~ ( element(X1,powerset(X0))
& empty(X0)
& in(X2,X1) ),
inference(rectify,[],[f24]) ).
fof(f24,axiom,
! [X2,X1,X0] :
~ ( empty(X2)
& in(X0,X1)
& element(X1,powerset(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t5_subset) ).
fof(f229,plain,
! [X0] :
( ~ element(sK10,powerset(X0))
| empty(X0)
| in(sK11,X0) ),
inference(resolution,[],[f219,f143]) ).
fof(f143,plain,
! [X0,X1] :
( ~ element(X1,X0)
| empty(X0)
| in(X1,X0) ),
inference(literal_reordering,[],[f110]) ).
fof(f110,plain,
! [X0,X1] :
( empty(X0)
| in(X1,X0)
| ~ element(X1,X0) ),
inference(cnf_transformation,[],[f46]) ).
fof(f46,plain,
! [X0,X1] :
( ~ element(X1,X0)
| empty(X0)
| in(X1,X0) ),
inference(flattening,[],[f45]) ).
fof(f45,plain,
! [X0,X1] :
( in(X1,X0)
| empty(X0)
| ~ element(X1,X0) ),
inference(ennf_transformation,[],[f35]) ).
fof(f35,plain,
! [X0,X1] :
( element(X1,X0)
=> ( in(X1,X0)
| empty(X0) ) ),
inference(rectify,[],[f21]) ).
fof(f21,axiom,
! [X1,X0] :
( element(X0,X1)
=> ( in(X0,X1)
| empty(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_subset) ).
fof(f219,plain,
! [X0] :
( element(sK11,X0)
| ~ element(sK10,powerset(X0)) ),
inference(resolution,[],[f163,f157]) ).
fof(f163,plain,
! [X2,X0,X1] :
( ~ in(X0,X1)
| element(X0,X2)
| ~ element(X1,powerset(X2)) ),
inference(literal_reordering,[],[f105]) ).
fof(f105,plain,
! [X2,X0,X1] :
( element(X0,X2)
| ~ element(X1,powerset(X2))
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f73]) ).
fof(f73,plain,
! [X0,X1,X2] :
( ~ in(X0,X1)
| element(X0,X2)
| ~ element(X1,powerset(X2)) ),
inference(rectify,[],[f54]) ).
fof(f54,plain,
! [X2,X0,X1] :
( ~ in(X2,X0)
| element(X2,X1)
| ~ element(X0,powerset(X1)) ),
inference(flattening,[],[f53]) ).
fof(f53,plain,
! [X2,X1,X0] :
( element(X2,X1)
| ~ element(X0,powerset(X1))
| ~ in(X2,X0) ),
inference(ennf_transformation,[],[f34]) ).
fof(f34,plain,
! [X2,X1,X0] :
( ( element(X0,powerset(X1))
& in(X2,X0) )
=> element(X2,X1) ),
inference(rectify,[],[f23]) ).
fof(f23,axiom,
! [X1,X2,X0] :
( ( in(X0,X1)
& element(X1,powerset(X2)) )
=> element(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t4_subset) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : NUM383+1 : TPTP v8.1.0. Released v3.2.0.
% 0.00/0.11 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.10/0.32 % Computer : n017.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Tue Aug 30 05:55:20 EDT 2022
% 0.10/0.32 % CPUTime :
% 0.16/0.47 % (15415)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.16/0.48 % (15408)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.16/0.48 % (15416)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.16/0.48 % (15423)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.16/0.49 % (15424)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.16/0.49 % (15417)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.16/0.49 % (15409)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.16/0.49 % (15409)Instruction limit reached!
% 0.16/0.49 % (15409)------------------------------
% 0.16/0.49 % (15409)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/0.49 % (15409)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/0.49 % (15409)Termination reason: Unknown
% 0.16/0.49 % (15409)Termination phase: Preprocessing 3
% 0.16/0.49
% 0.16/0.49 % (15409)Memory used [KB]: 895
% 0.16/0.49 % (15409)Time elapsed: 0.004 s
% 0.16/0.49 % (15409)Instructions burned: 2 (million)
% 0.16/0.49 % (15409)------------------------------
% 0.16/0.49 % (15409)------------------------------
% 0.16/0.49 % (15425)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.16/0.49 % (15415)First to succeed.
% 0.16/0.49 % (15407)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.16/0.49 TRYING [1]
% 0.16/0.49 % (15415)Refutation found. Thanks to Tanya!
% 0.16/0.49 % SZS status Theorem for theBenchmark
% 0.16/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.50 % (15415)------------------------------
% 0.16/0.50 % (15415)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/0.50 % (15415)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/0.50 % (15415)Termination reason: Refutation
% 0.16/0.50
% 0.16/0.50 % (15415)Memory used [KB]: 5884
% 0.16/0.50 % (15415)Time elapsed: 0.010 s
% 0.16/0.50 % (15415)Instructions burned: 6 (million)
% 0.16/0.50 % (15415)------------------------------
% 0.16/0.50 % (15415)------------------------------
% 0.16/0.50 % (15400)Success in time 0.168 s
%------------------------------------------------------------------------------