TSTP Solution File: SET639+3 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SET639+3 : 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 : n004.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:11 EDT 2022
% Result : Theorem 0.19s 0.51s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 13 unt; 0 def)
% Number of atoms : 42 ( 29 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 28 ( 9 ~; 2 |; 12 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 24 ( 18 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f69,plain,
$false,
inference(subsumption_resolution,[],[f68,f42]) ).
fof(f42,plain,
empty_set != sK1,
inference(cnf_transformation,[],[f25]) ).
fof(f25,plain,
( subset(sK1,sK2)
& empty_set != sK1
& empty_set = intersection(sK2,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f18,f24]) ).
fof(f24,plain,
( ? [X0,X1] :
( subset(X0,X1)
& empty_set != X0
& empty_set = intersection(X1,X0) )
=> ( subset(sK1,sK2)
& empty_set != sK1
& empty_set = intersection(sK2,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
? [X0,X1] :
( subset(X0,X1)
& empty_set != X0
& empty_set = intersection(X1,X0) ),
inference(flattening,[],[f17]) ).
fof(f17,plain,
? [X1,X0] :
( empty_set != X0
& empty_set = intersection(X1,X0)
& subset(X0,X1) ),
inference(ennf_transformation,[],[f11]) ).
fof(f11,negated_conjecture,
~ ! [X1,X0] :
( ( empty_set = intersection(X1,X0)
& subset(X0,X1) )
=> empty_set = X0 ),
inference(negated_conjecture,[],[f10]) ).
fof(f10,conjecture,
! [X1,X0] :
( ( empty_set = intersection(X1,X0)
& subset(X0,X1) )
=> empty_set = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th121) ).
fof(f68,plain,
empty_set = sK1,
inference(forward_demodulation,[],[f66,f62]) ).
fof(f62,plain,
empty_set = intersection(sK1,sK2),
inference(superposition,[],[f53,f61]) ).
fof(f61,plain,
empty_set = intersection(sK2,sK1),
inference(forward_demodulation,[],[f59,f60]) ).
fof(f60,plain,
empty_set = sF4,
inference(definition_folding,[],[f41,f59]) ).
fof(f41,plain,
empty_set = intersection(sK2,sK1),
inference(cnf_transformation,[],[f25]) ).
fof(f59,plain,
sF4 = intersection(sK2,sK1),
introduced(function_definition,[]) ).
fof(f53,plain,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
inference(rectify,[],[f6]) ).
fof(f6,axiom,
! [X1,X0] : intersection(X0,X1) = intersection(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_intersection) ).
fof(f66,plain,
intersection(sK1,sK2) = sK1,
inference(resolution,[],[f35,f43]) ).
fof(f43,plain,
subset(sK1,sK2),
inference(cnf_transformation,[],[f25]) ).
fof(f35,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| intersection(X1,X0) = X1 ),
inference(cnf_transformation,[],[f16]) ).
fof(f16,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| intersection(X1,X0) = X1 ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,plain,
! [X1,X0] :
( subset(X1,X0)
=> intersection(X1,X0) = X1 ),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
! [X1,X0] :
( subset(X0,X1)
=> intersection(X0,X1) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_intersection) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET639+3 : TPTP v8.1.0. Released v2.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 : n004.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:05:49 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.49 % (8433)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.19/0.50 % (8439)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.19/0.51 % (8425)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.19/0.51 % (8425)First to succeed.
% 0.19/0.51 % (8425)Refutation found. Thanks to Tanya!
% 0.19/0.51 % SZS status Theorem for theBenchmark
% 0.19/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.51 % (8425)------------------------------
% 0.19/0.51 % (8425)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (8425)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (8425)Termination reason: Refutation
% 0.19/0.51
% 0.19/0.51 % (8425)Memory used [KB]: 5373
% 0.19/0.51 % (8425)Time elapsed: 0.106 s
% 0.19/0.51 % (8425)Instructions burned: 2 (million)
% 0.19/0.51 % (8425)------------------------------
% 0.19/0.51 % (8425)------------------------------
% 0.19/0.51 % (8412)Success in time 0.163 s
%------------------------------------------------------------------------------