TSTP Solution File: SET162+4 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SET162+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 : n019.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:00 EDT 2022
% Result : Theorem 0.21s 0.51s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 46 ( 14 unt; 0 def)
% Number of atoms : 118 ( 1 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 119 ( 47 ~; 43 |; 17 &)
% ( 7 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 74 ( 69 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f275,plain,
$false,
inference(subsumption_resolution,[],[f274,f220]) ).
fof(f220,plain,
~ subset(sF4,sK3),
inference(subsumption_resolution,[],[f219,f90]) ).
fof(f90,plain,
~ equal_set(sF4,sK3),
inference(definition_folding,[],[f85,f89]) ).
fof(f89,plain,
union(sK3,empty_set) = sF4,
introduced(function_definition,[]) ).
fof(f85,plain,
~ equal_set(union(sK3,empty_set),sK3),
inference(cnf_transformation,[],[f57]) ).
fof(f57,plain,
~ equal_set(union(sK3,empty_set),sK3),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f26,f56]) ).
fof(f56,plain,
( ? [X0] : ~ equal_set(union(X0,empty_set),X0)
=> ~ equal_set(union(sK3,empty_set),sK3) ),
introduced(choice_axiom,[]) ).
fof(f26,plain,
? [X0] : ~ equal_set(union(X0,empty_set),X0),
inference(ennf_transformation,[],[f13]) ).
fof(f13,negated_conjecture,
~ ! [X0] : equal_set(union(X0,empty_set),X0),
inference(negated_conjecture,[],[f12]) ).
fof(f12,conjecture,
! [X0] : equal_set(union(X0,empty_set),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI18) ).
fof(f219,plain,
( equal_set(sF4,sK3)
| ~ subset(sF4,sK3) ),
inference(resolution,[],[f218,f67]) ).
fof(f67,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| equal_set(X0,X1)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f37]) ).
fof(f37,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| ~ subset(X1,X0)
| equal_set(X0,X1) ),
inference(rectify,[],[f28]) ).
fof(f28,plain,
! [X1,X0] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| equal_set(X1,X0) ),
inference(flattening,[],[f27]) ).
fof(f27,plain,
! [X0,X1] :
( equal_set(X1,X0)
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(ennf_transformation,[],[f23]) ).
fof(f23,plain,
! [X0,X1] :
( ( subset(X0,X1)
& subset(X1,X0) )
=> equal_set(X1,X0) ),
inference(unused_predicate_definition_removal,[],[f19]) ).
fof(f19,plain,
! [X0,X1] :
( ( subset(X0,X1)
& subset(X1,X0) )
<=> equal_set(X1,X0) ),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X1,X0] :
( equal_set(X0,X1)
<=> ( subset(X0,X1)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_set) ).
fof(f218,plain,
subset(sK3,sF4),
inference(duplicate_literal_removal,[],[f215]) ).
fof(f215,plain,
( subset(sK3,sF4)
| subset(sK3,sF4) ),
inference(resolution,[],[f132,f62]) ).
fof(f62,plain,
! [X0,X1] :
( ~ member(sK0(X0,X1),X0)
| subset(X1,X0) ),
inference(cnf_transformation,[],[f35]) ).
fof(f35,plain,
! [X0,X1] :
( ( ! [X2] :
( member(X2,X0)
| ~ member(X2,X1) )
| ~ subset(X1,X0) )
& ( subset(X1,X0)
| ( ~ member(sK0(X0,X1),X0)
& member(sK0(X0,X1),X1) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f33,f34]) ).
fof(f34,plain,
! [X0,X1] :
( ? [X3] :
( ~ member(X3,X0)
& member(X3,X1) )
=> ( ~ member(sK0(X0,X1),X0)
& member(sK0(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f33,plain,
! [X0,X1] :
( ( ! [X2] :
( member(X2,X0)
| ~ member(X2,X1) )
| ~ subset(X1,X0) )
& ( subset(X1,X0)
| ? [X3] :
( ~ member(X3,X0)
& member(X3,X1) ) ) ),
inference(rectify,[],[f32]) ).
fof(f32,plain,
! [X0,X1] :
( ( ! [X2] :
( member(X2,X0)
| ~ member(X2,X1) )
| ~ subset(X1,X0) )
& ( subset(X1,X0)
| ? [X2] :
( ~ member(X2,X0)
& member(X2,X1) ) ) ),
inference(nnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1] :
( ! [X2] :
( member(X2,X0)
| ~ member(X2,X1) )
<=> subset(X1,X0) ),
inference(ennf_transformation,[],[f14]) ).
fof(f14,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/sandbox/benchmark/theBenchmark.p',subset) ).
fof(f132,plain,
! [X0] :
( member(sK0(X0,sK3),sF4)
| subset(sK3,X0) ),
inference(resolution,[],[f106,f61]) ).
fof(f61,plain,
! [X0,X1] :
( member(sK0(X0,X1),X1)
| subset(X1,X0) ),
inference(cnf_transformation,[],[f35]) ).
fof(f106,plain,
! [X0] :
( ~ member(X0,sK3)
| member(X0,sF4) ),
inference(superposition,[],[f75,f89]) ).
fof(f75,plain,
! [X2,X0,X1] :
( member(X1,union(X0,X2))
| ~ member(X1,X0) ),
inference(cnf_transformation,[],[f47]) ).
fof(f47,plain,
! [X0,X1,X2] :
( ( member(X1,X0)
| member(X1,X2)
| ~ member(X1,union(X0,X2)) )
& ( member(X1,union(X0,X2))
| ( ~ member(X1,X0)
& ~ member(X1,X2) ) ) ),
inference(rectify,[],[f46]) ).
fof(f46,plain,
! [X2,X0,X1] :
( ( member(X0,X2)
| member(X0,X1)
| ~ member(X0,union(X2,X1)) )
& ( member(X0,union(X2,X1))
| ( ~ member(X0,X2)
& ~ member(X0,X1) ) ) ),
inference(flattening,[],[f45]) ).
fof(f45,plain,
! [X2,X0,X1] :
( ( member(X0,X2)
| member(X0,X1)
| ~ member(X0,union(X2,X1)) )
& ( member(X0,union(X2,X1))
| ( ~ member(X0,X2)
& ~ member(X0,X1) ) ) ),
inference(nnf_transformation,[],[f16]) ).
fof(f16,plain,
! [X2,X0,X1] :
( ( member(X0,X2)
| member(X0,X1) )
<=> member(X0,union(X2,X1)) ),
inference(rectify,[],[f5]) ).
fof(f5,axiom,
! [X2,X1,X0] :
( ( member(X2,X1)
| member(X2,X0) )
<=> member(X2,union(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',union) ).
fof(f274,plain,
subset(sF4,sK3),
inference(duplicate_literal_removal,[],[f269]) ).
fof(f269,plain,
( subset(sF4,sK3)
| subset(sF4,sK3) ),
inference(resolution,[],[f266,f62]) ).
fof(f266,plain,
! [X1] :
( member(sK0(X1,sF4),sK3)
| subset(sF4,X1) ),
inference(resolution,[],[f259,f61]) ).
fof(f259,plain,
! [X0] :
( ~ member(X0,sF4)
| member(X0,sK3) ),
inference(subsumption_resolution,[],[f258,f66]) ).
fof(f66,plain,
! [X0] : ~ member(X0,empty_set),
inference(cnf_transformation,[],[f15]) ).
fof(f15,plain,
! [X0] : ~ member(X0,empty_set),
inference(rectify,[],[f6]) ).
fof(f6,axiom,
! [X2] : ~ member(X2,empty_set),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',empty_set) ).
fof(f258,plain,
! [X0] :
( member(X0,sK3)
| member(X0,empty_set)
| ~ member(X0,sF4) ),
inference(superposition,[],[f76,f89]) ).
fof(f76,plain,
! [X2,X0,X1] :
( ~ member(X1,union(X0,X2))
| member(X1,X0)
| member(X1,X2) ),
inference(cnf_transformation,[],[f47]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET162+4 : TPTP v8.1.0. Released v2.2.0.
% 0.11/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.14/0.34 % Computer : n019.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Aug 30 13:27:35 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.49 % (7698)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.21/0.49 % (7690)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.21/0.49 TRYING [1]
% 0.21/0.50 % (7698)First to succeed.
% 0.21/0.50 TRYING [2]
% 0.21/0.50 TRYING [3]
% 0.21/0.51 TRYING [4]
% 0.21/0.51 % (7698)Refutation found. Thanks to Tanya!
% 0.21/0.51 % SZS status Theorem for theBenchmark
% 0.21/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.51 % (7698)------------------------------
% 0.21/0.51 % (7698)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.51 % (7698)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.51 % (7698)Termination reason: Refutation
% 0.21/0.51
% 0.21/0.51 % (7698)Memory used [KB]: 5500
% 0.21/0.51 % (7698)Time elapsed: 0.083 s
% 0.21/0.51 % (7698)Instructions burned: 9 (million)
% 0.21/0.51 % (7698)------------------------------
% 0.21/0.51 % (7698)------------------------------
% 0.21/0.51 % (7672)Success in time 0.158 s
%------------------------------------------------------------------------------