TSTP Solution File: SET576+3 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET576+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_uns --cores 0 -t %d %s
% Computer : n020.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:21:28 EDT 2022
% Result : Theorem 0.20s 0.52s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 5 unt; 0 def)
% Number of atoms : 84 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 101 ( 47 ~; 26 |; 16 &)
% ( 3 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 59 ( 49 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f41,plain,
$false,
inference(subsumption_resolution,[],[f40,f32]) ).
fof(f32,plain,
intersect(sK2,sK1),
inference(unit_resulting_resolution,[],[f27,f19]) ).
fof(f19,plain,
! [X0,X1] :
( intersect(X1,X0)
| ~ intersect(X0,X1) ),
inference(cnf_transformation,[],[f9]) ).
fof(f9,plain,
! [X0,X1] :
( intersect(X1,X0)
| ~ intersect(X0,X1) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0,X1] :
( intersect(X0,X1)
=> intersect(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_intersect) ).
fof(f27,plain,
intersect(sK1,sK2),
inference(unit_resulting_resolution,[],[f25,f20]) ).
fof(f20,plain,
! [X0,X1] :
( intersect(X0,X1)
| disjoint(X0,X1) ),
inference(cnf_transformation,[],[f11]) ).
fof(f11,plain,
! [X0,X1] :
( ( ~ intersect(X0,X1)
| ~ disjoint(X0,X1) )
& ( disjoint(X0,X1)
| intersect(X0,X1) ) ),
inference(rectify,[],[f10]) ).
fof(f10,plain,
! [X1,X0] :
( ( ~ intersect(X1,X0)
| ~ disjoint(X1,X0) )
& ( disjoint(X1,X0)
| intersect(X1,X0) ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f6,plain,
! [X1,X0] :
( ~ intersect(X1,X0)
<=> disjoint(X1,X0) ),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X1,X0] :
( disjoint(X0,X1)
<=> ~ intersect(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',disjoint_defn) ).
fof(f25,plain,
~ disjoint(sK1,sK2),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
( ! [X2] :
( ~ member(X2,sK2)
| ~ member(X2,sK1) )
& ~ disjoint(sK1,sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f16,f17]) ).
fof(f17,plain,
( ? [X0,X1] :
( ! [X2] :
( ~ member(X2,X1)
| ~ member(X2,X0) )
& ~ disjoint(X0,X1) )
=> ( ! [X2] :
( ~ member(X2,sK2)
| ~ member(X2,sK1) )
& ~ disjoint(sK1,sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
? [X0,X1] :
( ! [X2] :
( ~ member(X2,X1)
| ~ member(X2,X0) )
& ~ disjoint(X0,X1) ),
inference(rectify,[],[f8]) ).
fof(f8,plain,
? [X1,X0] :
( ! [X2] :
( ~ member(X2,X0)
| ~ member(X2,X1) )
& ~ disjoint(X1,X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,plain,
~ ! [X1,X0] :
( ! [X2] :
( member(X2,X1)
=> ~ member(X2,X0) )
=> disjoint(X1,X0) ),
inference(rectify,[],[f5]) ).
fof(f5,negated_conjecture,
~ ! [X1,X0] :
( ! [X2] :
( member(X2,X0)
=> ~ member(X2,X1) )
=> disjoint(X0,X1) ),
inference(negated_conjecture,[],[f4]) ).
fof(f4,conjecture,
! [X1,X0] :
( ! [X2] :
( member(X2,X0)
=> ~ member(X2,X1) )
=> disjoint(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th17) ).
fof(f40,plain,
~ intersect(sK2,sK1),
inference(duplicate_literal_removal,[],[f39]) ).
fof(f39,plain,
( ~ intersect(sK2,sK1)
| ~ intersect(sK2,sK1) ),
inference(resolution,[],[f29,f22]) ).
fof(f22,plain,
! [X0,X1] :
( member(sK0(X0,X1),X1)
| ~ intersect(X0,X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f15,plain,
! [X0,X1] :
( ( intersect(X0,X1)
| ! [X2] :
( ~ member(X2,X0)
| ~ member(X2,X1) ) )
& ( ( member(sK0(X0,X1),X0)
& member(sK0(X0,X1),X1) )
| ~ intersect(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f13,f14]) ).
fof(f14,plain,
! [X0,X1] :
( ? [X3] :
( member(X3,X0)
& member(X3,X1) )
=> ( member(sK0(X0,X1),X0)
& member(sK0(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
! [X0,X1] :
( ( intersect(X0,X1)
| ! [X2] :
( ~ member(X2,X0)
| ~ member(X2,X1) ) )
& ( ? [X3] :
( member(X3,X0)
& member(X3,X1) )
| ~ intersect(X0,X1) ) ),
inference(rectify,[],[f12]) ).
fof(f12,plain,
! [X0,X1] :
( ( intersect(X0,X1)
| ! [X2] :
( ~ member(X2,X0)
| ~ member(X2,X1) ) )
& ( ? [X2] :
( member(X2,X0)
& member(X2,X1) )
| ~ intersect(X0,X1) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] :
( intersect(X0,X1)
<=> ? [X2] :
( member(X2,X0)
& member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersect_defn) ).
fof(f29,plain,
! [X0] :
( ~ member(sK0(sK2,X0),sK1)
| ~ intersect(sK2,X0) ),
inference(resolution,[],[f26,f23]) ).
fof(f23,plain,
! [X0,X1] :
( member(sK0(X0,X1),X0)
| ~ intersect(X0,X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f26,plain,
! [X2] :
( ~ member(X2,sK2)
| ~ member(X2,sK1) ),
inference(cnf_transformation,[],[f18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SET576+3 : TPTP v8.1.0. Released v2.2.0.
% 0.08/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.14/0.35 % Computer : n020.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Aug 30 14:02:45 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.20/0.51 % (14190)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.20/0.51 % (14183)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.20/0.51 % (14190)First to succeed.
% 0.20/0.51 % (14192)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.20/0.52 % (14191)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.20/0.52 % (14183)Also succeeded, but the first one will report.
% 0.20/0.52 % (14190)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 % (14190)------------------------------
% 0.20/0.52 % (14190)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (14190)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (14190)Termination reason: Refutation
% 0.20/0.52
% 0.20/0.52 % (14190)Memory used [KB]: 5884
% 0.20/0.52 % (14190)Time elapsed: 0.105 s
% 0.20/0.52 % (14190)Instructions burned: 2 (million)
% 0.20/0.52 % (14190)------------------------------
% 0.20/0.52 % (14190)------------------------------
% 0.20/0.52 % (14182)Success in time 0.161 s
%------------------------------------------------------------------------------