TSTP Solution File: SET046+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SET046+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n028.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 : Sun May 5 09:10:44 EDT 2024
% Result : Theorem 0.16s 0.33s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 2 unt; 0 def)
% Number of atoms : 62 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 74 ( 29 ~; 24 |; 15 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 37 ( 22 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f18,plain,
$false,
inference(subsumption_resolution,[],[f17,f10]) ).
fof(f10,plain,
! [X3,X1] :
( ~ element(X3,X1)
| ~ element(X1,X3)
| ~ element(X1,sK0) ),
inference(cnf_transformation,[],[f9]) ).
fof(f9,plain,
! [X1] :
( ( element(X1,sK0)
| ( element(sK1(X1),X1)
& element(X1,sK1(X1)) ) )
& ( ! [X3] :
( ~ element(X3,X1)
| ~ element(X1,X3) )
| ~ element(X1,sK0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f8,f7]) ).
fof(f7,plain,
( ? [X0] :
! [X1] :
( ( element(X1,X0)
| ? [X2] :
( element(X2,X1)
& element(X1,X2) ) )
& ( ! [X3] :
( ~ element(X3,X1)
| ~ element(X1,X3) )
| ~ element(X1,X0) ) )
=> ! [X1] :
( ( element(X1,sK0)
| ? [X2] :
( element(X2,X1)
& element(X1,X2) ) )
& ( ! [X3] :
( ~ element(X3,X1)
| ~ element(X1,X3) )
| ~ element(X1,sK0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
! [X1] :
( ? [X2] :
( element(X2,X1)
& element(X1,X2) )
=> ( element(sK1(X1),X1)
& element(X1,sK1(X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
? [X0] :
! [X1] :
( ( element(X1,X0)
| ? [X2] :
( element(X2,X1)
& element(X1,X2) ) )
& ( ! [X3] :
( ~ element(X3,X1)
| ~ element(X1,X3) )
| ~ element(X1,X0) ) ),
inference(rectify,[],[f5]) ).
fof(f5,plain,
? [X0] :
! [X1] :
( ( element(X1,X0)
| ? [X2] :
( element(X2,X1)
& element(X1,X2) ) )
& ( ! [X2] :
( ~ element(X2,X1)
| ~ element(X1,X2) )
| ~ element(X1,X0) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,plain,
? [X0] :
! [X1] :
( element(X1,X0)
<=> ! [X2] :
( ~ element(X2,X1)
| ~ element(X1,X2) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
? [X0] :
! [X1] :
( element(X1,X0)
<=> ~ ? [X2] :
( element(X2,X1)
& element(X1,X2) ) ),
inference(flattening,[],[f2]) ).
fof(f2,negated_conjecture,
~ ~ ? [X0] :
! [X1] :
( element(X1,X0)
<=> ~ ? [X2] :
( element(X2,X1)
& element(X1,X2) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
~ ? [X0] :
! [X1] :
( element(X1,X0)
<=> ~ ? [X2] :
( element(X2,X1)
& element(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel42) ).
fof(f17,plain,
element(sK0,sK0),
inference(duplicate_literal_removal,[],[f16]) ).
fof(f16,plain,
( element(sK0,sK0)
| element(sK0,sK0) ),
inference(resolution,[],[f15,f12]) ).
fof(f12,plain,
! [X1] :
( element(sK1(X1),X1)
| element(X1,sK0) ),
inference(cnf_transformation,[],[f9]) ).
fof(f15,plain,
! [X0] :
( ~ element(sK1(X0),sK0)
| element(X0,sK0) ),
inference(subsumption_resolution,[],[f13,f12]) ).
fof(f13,plain,
! [X0] :
( ~ element(sK1(X0),X0)
| ~ element(sK1(X0),sK0)
| element(X0,sK0) ),
inference(resolution,[],[f10,f11]) ).
fof(f11,plain,
! [X1] :
( element(X1,sK1(X1))
| element(X1,sK0) ),
inference(cnf_transformation,[],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SET046+1 : TPTP v8.1.2. Released v2.0.0.
% 0.11/0.12 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.12/0.31 % Computer : n028.cluster.edu
% 0.12/0.31 % Model : x86_64 x86_64
% 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31 % Memory : 8042.1875MB
% 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31 % CPULimit : 300
% 0.12/0.31 % WCLimit : 300
% 0.12/0.31 % DateTime : Fri May 3 16:20:08 EDT 2024
% 0.12/0.32 % CPUTime :
% 0.12/0.32 % (17950)Running in auto input_syntax mode. Trying TPTP
% 0.12/0.33 % (17959)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.12/0.33 % (17959)First to succeed.
% 0.12/0.33 % (17959)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-17950"
% 0.16/0.33 % (17959)Refutation found. Thanks to Tanya!
% 0.16/0.33 % SZS status Theorem for theBenchmark
% 0.16/0.33 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.33 % (17959)------------------------------
% 0.16/0.33 % (17959)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.16/0.33 % (17959)Termination reason: Refutation
% 0.16/0.33
% 0.16/0.33 % (17959)Memory used [KB]: 744
% 0.16/0.33 % (17959)Time elapsed: 0.002 s
% 0.16/0.33 % (17959)Instructions burned: 2 (million)
% 0.16/0.33 % (17950)Success in time 0.003 s
%------------------------------------------------------------------------------