TSTP Solution File: SEU186+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SEU186+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -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 : Tue Apr 30 15:23:27 EDT 2024
% Result : Theorem 0.13s 0.37s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 32 ( 12 unt; 0 def)
% Number of atoms : 70 ( 19 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 71 ( 33 ~; 15 |; 12 &)
% ( 1 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 59 ( 50 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f218,plain,
$false,
inference(subsumption_resolution,[],[f215,f64]) ).
fof(f64,plain,
! [X0] : element(sK3(X0),X0),
inference(cnf_transformation,[],[f45]) ).
fof(f45,plain,
! [X0] : element(sK3(X0),X0),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f11,f44]) ).
fof(f44,plain,
! [X0] :
( ? [X1] : element(X1,X0)
=> element(sK3(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f11,axiom,
! [X0] :
? [X1] : element(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',existence_m1_subset_1) ).
fof(f215,plain,
~ element(sK3(sK0),sK0),
inference(superposition,[],[f117,f204]) ).
fof(f204,plain,
sK3(sK0) = ordered_pair(sK1(sK3(sK0)),sK2(sK3(sK0))),
inference(unit_resulting_resolution,[],[f54,f121,f63]) ).
fof(f63,plain,
! [X0,X1] :
( ~ in(X1,X0)
| ordered_pair(sK1(X1),sK2(X1)) = X1
| ~ relation(X0) ),
inference(cnf_transformation,[],[f43]) ).
fof(f43,plain,
! [X0] :
( ! [X1] :
( ordered_pair(sK1(X1),sK2(X1)) = X1
| ~ in(X1,X0) )
| ~ relation(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f33,f42]) ).
fof(f42,plain,
! [X1] :
( ? [X2,X3] : ordered_pair(X2,X3) = X1
=> ordered_pair(sK1(X1),sK2(X1)) = X1 ),
introduced(choice_axiom,[]) ).
fof(f33,plain,
! [X0] :
( ! [X1] :
( ? [X2,X3] : ordered_pair(X2,X3) = X1
| ~ in(X1,X0) )
| ~ relation(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f28,plain,
! [X0] :
( relation(X0)
=> ! [X1] :
~ ( ! [X2,X3] : ordered_pair(X2,X3) != X1
& in(X1,X0) ) ),
inference(unused_predicate_definition_removal,[],[f4]) ).
fof(f4,axiom,
! [X0] :
( relation(X0)
<=> ! [X1] :
~ ( ! [X2,X3] : ordered_pair(X2,X3) != X1
& in(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_relat_1) ).
fof(f121,plain,
in(sK3(sK0),sK0),
inference(unit_resulting_resolution,[],[f89,f64,f71]) ).
fof(f71,plain,
! [X0,X1] :
( ~ element(X0,X1)
| empty(X1)
| in(X0,X1) ),
inference(cnf_transformation,[],[f37]) ).
fof(f37,plain,
! [X0,X1] :
( in(X0,X1)
| empty(X1)
| ~ element(X0,X1) ),
inference(flattening,[],[f36]) ).
fof(f36,plain,
! [X0,X1] :
( in(X0,X1)
| empty(X1)
| ~ element(X0,X1) ),
inference(ennf_transformation,[],[f22]) ).
fof(f22,axiom,
! [X0,X1] :
( element(X0,X1)
=> ( in(X0,X1)
| empty(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_subset) ).
fof(f89,plain,
~ empty(sK0),
inference(unit_resulting_resolution,[],[f56,f62]) ).
fof(f62,plain,
! [X0] :
( ~ empty(X0)
| empty_set = X0 ),
inference(cnf_transformation,[],[f32]) ).
fof(f32,plain,
! [X0] :
( empty_set = X0
| ~ empty(X0) ),
inference(ennf_transformation,[],[f25]) ).
fof(f25,axiom,
! [X0] :
( empty(X0)
=> empty_set = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_boole) ).
fof(f56,plain,
empty_set != sK0,
inference(cnf_transformation,[],[f41]) ).
fof(f41,plain,
( empty_set != sK0
& ! [X1,X2] : ~ in(ordered_pair(X1,X2),sK0)
& relation(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f30,f40]) ).
fof(f40,plain,
( ? [X0] :
( empty_set != X0
& ! [X1,X2] : ~ in(ordered_pair(X1,X2),X0)
& relation(X0) )
=> ( empty_set != sK0
& ! [X2,X1] : ~ in(ordered_pair(X1,X2),sK0)
& relation(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f30,plain,
? [X0] :
( empty_set != X0
& ! [X1,X2] : ~ in(ordered_pair(X1,X2),X0)
& relation(X0) ),
inference(flattening,[],[f29]) ).
fof(f29,plain,
? [X0] :
( empty_set != X0
& ! [X1,X2] : ~ in(ordered_pair(X1,X2),X0)
& relation(X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f24,negated_conjecture,
~ ! [X0] :
( relation(X0)
=> ( ! [X1,X2] : ~ in(ordered_pair(X1,X2),X0)
=> empty_set = X0 ) ),
inference(negated_conjecture,[],[f23]) ).
fof(f23,conjecture,
! [X0] :
( relation(X0)
=> ( ! [X1,X2] : ~ in(ordered_pair(X1,X2),X0)
=> empty_set = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t56_relat_1) ).
fof(f54,plain,
relation(sK0),
inference(cnf_transformation,[],[f41]) ).
fof(f117,plain,
! [X0,X1] : ~ element(ordered_pair(X0,X1),sK0),
inference(unit_resulting_resolution,[],[f55,f89,f71]) ).
fof(f55,plain,
! [X2,X1] : ~ in(ordered_pair(X1,X2),sK0),
inference(cnf_transformation,[],[f41]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SEU186+1 : TPTP v8.1.2. Released v3.3.0.
% 0.08/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.35 % Computer : n020.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Apr 29 20:34:32 EDT 2024
% 0.13/0.36 % CPUTime :
% 0.13/0.36 % (3158)Running in auto input_syntax mode. Trying TPTP
% 0.13/0.37 % (3165)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.13/0.37 % (3165)First to succeed.
% 0.13/0.37 % (3165)Refutation found. Thanks to Tanya!
% 0.13/0.37 % SZS status Theorem for theBenchmark
% 0.13/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.37 % (3165)------------------------------
% 0.13/0.37 % (3165)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.13/0.37 % (3165)Termination reason: Refutation
% 0.13/0.37
% 0.13/0.37 % (3165)Memory used [KB]: 845
% 0.13/0.37 % (3165)Time elapsed: 0.004 s
% 0.13/0.37 % (3165)Instructions burned: 9 (million)
% 0.13/0.37 % (3165)------------------------------
% 0.13/0.37 % (3165)------------------------------
% 0.13/0.37 % (3158)Success in time 0.014 s
%------------------------------------------------------------------------------