TSTP Solution File: SET027+3 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SET027+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n008.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:05:06 EDT 2024
% Result : Theorem 0.14s 0.37s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 5 unt; 0 def)
% Number of atoms : 73 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 72 ( 24 ~; 21 |; 20 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 49 ( 37 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f38,plain,
$false,
inference(subsumption_resolution,[],[f37,f16]) ).
fof(f16,plain,
~ subset(sK0,sK2),
inference(cnf_transformation,[],[f9]) ).
fof(f9,plain,
( ~ subset(sK0,sK2)
& subset(sK1,sK2)
& subset(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f6,f8]) ).
fof(f8,plain,
( ? [X0,X1,X2] :
( ~ subset(X0,X2)
& subset(X1,X2)
& subset(X0,X1) )
=> ( ~ subset(sK0,sK2)
& subset(sK1,sK2)
& subset(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
? [X0,X1,X2] :
( ~ subset(X0,X2)
& subset(X1,X2)
& subset(X0,X1) ),
inference(flattening,[],[f5]) ).
fof(f5,plain,
? [X0,X1,X2] :
( ~ subset(X0,X2)
& subset(X1,X2)
& subset(X0,X1) ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,negated_conjecture,
~ ! [X0,X1,X2] :
( ( subset(X1,X2)
& subset(X0,X1) )
=> subset(X0,X2) ),
inference(negated_conjecture,[],[f3]) ).
fof(f3,conjecture,
! [X0,X1,X2] :
( ( subset(X1,X2)
& subset(X0,X1) )
=> subset(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_transitivity_of_subset) ).
fof(f37,plain,
subset(sK0,sK2),
inference(duplicate_literal_removal,[],[f35]) ).
fof(f35,plain,
( subset(sK0,sK2)
| subset(sK0,sK2) ),
inference(resolution,[],[f33,f20]) ).
fof(f20,plain,
! [X0,X1] :
( ~ member(sK3(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f13]) ).
fof(f13,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK3(X0,X1),X1)
& member(sK3(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f11,f12]) ).
fof(f12,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK3(X0,X1),X1)
& member(sK3(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f11,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f10]) ).
fof(f10,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f7,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_defn) ).
fof(f33,plain,
! [X0] :
( member(sK3(sK0,X0),sK2)
| subset(sK0,X0) ),
inference(resolution,[],[f28,f15]) ).
fof(f15,plain,
subset(sK1,sK2),
inference(cnf_transformation,[],[f9]) ).
fof(f28,plain,
! [X0,X1] :
( ~ subset(sK1,X1)
| member(sK3(sK0,X0),X1)
| subset(sK0,X0) ),
inference(resolution,[],[f24,f18]) ).
fof(f18,plain,
! [X3,X0,X1] :
( ~ member(X3,X0)
| member(X3,X1)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f13]) ).
fof(f24,plain,
! [X0] :
( member(sK3(sK0,X0),sK1)
| subset(sK0,X0) ),
inference(resolution,[],[f23,f14]) ).
fof(f14,plain,
subset(sK0,sK1),
inference(cnf_transformation,[],[f9]) ).
fof(f23,plain,
! [X2,X0,X1] :
( ~ subset(X0,X2)
| member(sK3(X0,X1),X2)
| subset(X0,X1) ),
inference(resolution,[],[f18,f19]) ).
fof(f19,plain,
! [X0,X1] :
( member(sK3(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET027+3 : TPTP v8.1.2. Released v2.2.0.
% 0.07/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35 % Computer : n008.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 Apr 30 01:31:58 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 % (20836)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.37 % (20838)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.14/0.37 % (20840)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.14/0.37 % (20841)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.14/0.37 % (20842)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.14/0.37 % (20839)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.14/0.37 % (20837)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.14/0.37 % (20843)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2:si=on:rtra=on:rawr=on:rp=on:fmbksg=on_1451 on theBenchmark for (1451ds/0Mi)
% 0.14/0.37 TRYING [1]
% 0.14/0.37 TRYING [1,1]
% 0.14/0.37 TRYING [1]
% 0.14/0.37 TRYING [1,1]
% 0.14/0.37 TRYING [2]
% 0.14/0.37 TRYING [2]
% 0.14/0.37 TRYING [2,1]
% 0.14/0.37 TRYING [2,1]
% 0.14/0.37 TRYING [3,1]
% 0.14/0.37 TRYING [3]
% 0.14/0.37 % (20841)First to succeed.
% 0.14/0.37 TRYING [3]
% 0.14/0.37 TRYING [3,1]
% 0.14/0.37 TRYING [2,2]
% 0.14/0.37 TRYING [2,2]
% 0.14/0.37 TRYING [4]
% 0.14/0.37 TRYING [3,2]
% 0.14/0.37 TRYING [3,2]
% 0.14/0.37 TRYING [4]
% 0.14/0.37 % (20839)Also succeeded, but the first one will report.
% 0.14/0.37 TRYING [3,3]
% 0.14/0.37 TRYING [3,3]
% 0.14/0.37 TRYING [5]
% 0.14/0.37 TRYING [5]
% 0.14/0.37 TRYING [4,4]
% 0.14/0.37 TRYING [4,4]
% 0.14/0.37 % (20842)Also succeeded, but the first one will report.
% 0.14/0.37 % (20841)Refutation found. Thanks to Tanya!
% 0.14/0.37 % SZS status Theorem for theBenchmark
% 0.14/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.38 % (20841)------------------------------
% 0.14/0.38 % (20841)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.14/0.38 % (20841)Termination reason: Refutation
% 0.14/0.38
% 0.14/0.38 % (20841)Memory used [KB]: 746
% 0.14/0.38 % (20841)Time elapsed: 0.004 s
% 0.14/0.38 % (20841)Instructions burned: 3 (million)
% 0.14/0.38 % (20841)------------------------------
% 0.14/0.38 % (20841)------------------------------
% 0.14/0.38 % (20836)Success in time 0.007 s
%------------------------------------------------------------------------------