TSTP Solution File: SEU167+3 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SEU167+3 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n003.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:22:46 EDT 2024
% Result : Theorem 0.15s 0.39s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 7 unt; 0 def)
% Number of atoms : 52 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 47 ( 17 ~; 10 |; 15 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 48 ( 36 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f82,plain,
$false,
inference(subsumption_resolution,[],[f73,f22]) ).
fof(f22,plain,
~ subset(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK3)),
inference(cnf_transformation,[],[f15]) ).
fof(f15,plain,
( ~ subset(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK3))
& subset(sK2,sK3)
& subset(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f10,f14]) ).
fof(f14,plain,
( ? [X0,X1,X2,X3] :
( ~ subset(cartesian_product2(X0,X2),cartesian_product2(X1,X3))
& subset(X2,X3)
& subset(X0,X1) )
=> ( ~ subset(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK3))
& subset(sK2,sK3)
& subset(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f10,plain,
? [X0,X1,X2,X3] :
( ~ subset(cartesian_product2(X0,X2),cartesian_product2(X1,X3))
& subset(X2,X3)
& subset(X0,X1) ),
inference(flattening,[],[f9]) ).
fof(f9,plain,
? [X0,X1,X2,X3] :
( ~ subset(cartesian_product2(X0,X2),cartesian_product2(X1,X3))
& subset(X2,X3)
& subset(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( subset(X2,X3)
& subset(X0,X1) )
=> subset(cartesian_product2(X0,X2),cartesian_product2(X1,X3)) ),
inference(negated_conjecture,[],[f5]) ).
fof(f5,conjecture,
! [X0,X1,X2,X3] :
( ( subset(X2,X3)
& subset(X0,X1) )
=> subset(cartesian_product2(X0,X2),cartesian_product2(X1,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t119_zfmisc_1) ).
fof(f73,plain,
subset(cartesian_product2(sK0,sK2),cartesian_product2(sK1,sK3)),
inference(resolution,[],[f63,f38]) ).
fof(f38,plain,
! [X0,X1] :
( ~ subset(X0,cartesian_product2(sK0,X1))
| subset(X0,cartesian_product2(sK1,X1)) ),
inference(resolution,[],[f34,f26]) ).
fof(f26,plain,
! [X2,X0,X1] :
( ~ subset(X1,X2)
| subset(X0,X2)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f13]) ).
fof(f13,plain,
! [X0,X1,X2] :
( subset(X0,X2)
| ~ subset(X1,X2)
| ~ subset(X0,X1) ),
inference(flattening,[],[f12]) ).
fof(f12,plain,
! [X0,X1,X2] :
( subset(X0,X2)
| ~ subset(X1,X2)
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0,X1,X2] :
( ( subset(X1,X2)
& subset(X0,X1) )
=> subset(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_xboole_1) ).
fof(f34,plain,
! [X0] : subset(cartesian_product2(sK0,X0),cartesian_product2(sK1,X0)),
inference(resolution,[],[f24,f20]) ).
fof(f20,plain,
subset(sK0,sK1),
inference(cnf_transformation,[],[f15]) ).
fof(f24,plain,
! [X2,X0,X1] :
( ~ subset(X0,X1)
| subset(cartesian_product2(X0,X2),cartesian_product2(X1,X2)) ),
inference(cnf_transformation,[],[f11]) ).
fof(f11,plain,
! [X0,X1,X2] :
( ( subset(cartesian_product2(X2,X0),cartesian_product2(X2,X1))
& subset(cartesian_product2(X0,X2),cartesian_product2(X1,X2)) )
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0,X1,X2] :
( subset(X0,X1)
=> ( subset(cartesian_product2(X2,X0),cartesian_product2(X2,X1))
& subset(cartesian_product2(X0,X2),cartesian_product2(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t118_zfmisc_1) ).
fof(f63,plain,
! [X0] : subset(cartesian_product2(X0,sK2),cartesian_product2(X0,sK3)),
inference(resolution,[],[f25,f21]) ).
fof(f21,plain,
subset(sK2,sK3),
inference(cnf_transformation,[],[f15]) ).
fof(f25,plain,
! [X2,X0,X1] :
( ~ subset(X0,X1)
| subset(cartesian_product2(X2,X0),cartesian_product2(X2,X1)) ),
inference(cnf_transformation,[],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU167+3 : TPTP v8.1.2. Released v3.2.0.
% 0.12/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36 % Computer : n003.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon Apr 29 20:32:48 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 % (28100)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.39 % (28103)dis-2_2:3_amm=sco:anc=none:bce=on:fsr=off:gsp=on:nm=16:nwc=1.2:nicw=on:sac=on:sp=weighted_frequency_476 on theBenchmark for (476ds/0Mi)
% 0.15/0.39 % (28105)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.15/0.39 % (28105)First to succeed.
% 0.15/0.39 % (28103)Also succeeded, but the first one will report.
% 0.15/0.39 % (28105)Refutation found. Thanks to Tanya!
% 0.15/0.39 % SZS status Theorem for theBenchmark
% 0.15/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.39 % (28105)------------------------------
% 0.15/0.39 % (28105)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.15/0.39 % (28105)Termination reason: Refutation
% 0.15/0.39
% 0.15/0.39 % (28105)Memory used [KB]: 753
% 0.15/0.39 % (28105)Time elapsed: 0.004 s
% 0.15/0.39 % (28105)Instructions burned: 4 (million)
% 0.15/0.39 % (28105)------------------------------
% 0.15/0.39 % (28105)------------------------------
% 0.15/0.39 % (28100)Success in time 0.027 s
%------------------------------------------------------------------------------