TSTP Solution File: SET734+4 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET734+4 : TPTP v8.2.0. Bugfixed v2.2.1.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n013.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 May 21 03:13:01 EDT 2024
% Result : Theorem 0.60s 0.77s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 38 ( 8 unt; 0 def)
% Number of atoms : 154 ( 0 equ)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 167 ( 51 ~; 41 |; 51 &)
% ( 8 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 8 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-5 aty)
% Number of variables : 154 ( 130 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f98,plain,
$false,
inference(subsumption_resolution,[],[f96,f92]) ).
fof(f92,plain,
apply(sK1,sK5(sK1,sK0,sK2,sK6(sK1,sK2,sK3),sK6(sK1,sK2,sK3)),sK6(sK1,sK2,sK3)),
inference(unit_resulting_resolution,[],[f71,f71,f73,f67]) ).
fof(f67,plain,
! [X2,X3,X0,X1,X6,X4,X5] :
( apply(X0,sK5(X0,X1,X3,X5,X6),X6)
| ~ apply(compose_function(X0,X1,X2,X3,X4),X5,X6)
| ~ member(X6,X4)
| ~ member(X5,X2) ),
inference(cnf_transformation,[],[f54]) ).
fof(f54,plain,
! [X0,X1,X2,X3,X4,X5,X6] :
( ( ( apply(compose_function(X0,X1,X2,X3,X4),X5,X6)
| ! [X7] :
( ~ apply(X0,X7,X6)
| ~ apply(X1,X5,X7)
| ~ member(X7,X3) ) )
& ( ( apply(X0,sK5(X0,X1,X3,X5,X6),X6)
& apply(X1,X5,sK5(X0,X1,X3,X5,X6))
& member(sK5(X0,X1,X3,X5,X6),X3) )
| ~ apply(compose_function(X0,X1,X2,X3,X4),X5,X6) ) )
| ~ member(X6,X4)
| ~ member(X5,X2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f52,f53]) ).
fof(f53,plain,
! [X0,X1,X3,X5,X6] :
( ? [X8] :
( apply(X0,X8,X6)
& apply(X1,X5,X8)
& member(X8,X3) )
=> ( apply(X0,sK5(X0,X1,X3,X5,X6),X6)
& apply(X1,X5,sK5(X0,X1,X3,X5,X6))
& member(sK5(X0,X1,X3,X5,X6),X3) ) ),
introduced(choice_axiom,[]) ).
fof(f52,plain,
! [X0,X1,X2,X3,X4,X5,X6] :
( ( ( apply(compose_function(X0,X1,X2,X3,X4),X5,X6)
| ! [X7] :
( ~ apply(X0,X7,X6)
| ~ apply(X1,X5,X7)
| ~ member(X7,X3) ) )
& ( ? [X8] :
( apply(X0,X8,X6)
& apply(X1,X5,X8)
& member(X8,X3) )
| ~ apply(compose_function(X0,X1,X2,X3,X4),X5,X6) ) )
| ~ member(X6,X4)
| ~ member(X5,X2) ),
inference(rectify,[],[f51]) ).
fof(f51,plain,
! [X0,X1,X2,X3,X4,X5,X6] :
( ( ( apply(compose_function(X0,X1,X2,X3,X4),X5,X6)
| ! [X7] :
( ~ apply(X0,X7,X6)
| ~ apply(X1,X5,X7)
| ~ member(X7,X3) ) )
& ( ? [X7] :
( apply(X0,X7,X6)
& apply(X1,X5,X7)
& member(X7,X3) )
| ~ apply(compose_function(X0,X1,X2,X3,X4),X5,X6) ) )
| ~ member(X6,X4)
| ~ member(X5,X2) ),
inference(nnf_transformation,[],[f45]) ).
fof(f45,plain,
! [X0,X1,X2,X3,X4,X5,X6] :
( ( apply(compose_function(X0,X1,X2,X3,X4),X5,X6)
<=> ? [X7] :
( apply(X0,X7,X6)
& apply(X1,X5,X7)
& member(X7,X3) ) )
| ~ member(X6,X4)
| ~ member(X5,X2) ),
inference(flattening,[],[f44]) ).
fof(f44,plain,
! [X0,X1,X2,X3,X4,X5,X6] :
( ( apply(compose_function(X0,X1,X2,X3,X4),X5,X6)
<=> ? [X7] :
( apply(X0,X7,X6)
& apply(X1,X5,X7)
& member(X7,X3) ) )
| ~ member(X6,X4)
| ~ member(X5,X2) ),
inference(ennf_transformation,[],[f34]) ).
fof(f34,plain,
! [X0,X1,X2,X3,X4,X5,X6] :
( ( member(X6,X4)
& member(X5,X2) )
=> ( apply(compose_function(X0,X1,X2,X3,X4),X5,X6)
<=> ? [X7] :
( apply(X0,X7,X6)
& apply(X1,X5,X7)
& member(X7,X3) ) ) ),
inference(rectify,[],[f14]) ).
fof(f14,axiom,
! [X9,X5,X0,X1,X10,X2,X11] :
( ( member(X11,X10)
& member(X2,X0) )
=> ( apply(compose_function(X9,X5,X0,X1,X10),X2,X11)
<=> ? [X4] :
( apply(X9,X4,X11)
& apply(X5,X2,X4)
& member(X4,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',compose_function) ).
fof(f73,plain,
apply(compose_function(sK1,sK0,sK3,sK2,sK3),sK6(sK1,sK2,sK3),sK6(sK1,sK2,sK3)),
inference(unit_resulting_resolution,[],[f59,f71,f64]) ).
fof(f64,plain,
! [X2,X0,X1] :
( ~ member(X2,X1)
| apply(X0,X2,X2)
| ~ identity(X0,X1) ),
inference(cnf_transformation,[],[f43]) ).
fof(f43,plain,
! [X0,X1] :
( ! [X2] :
( apply(X0,X2,X2)
| ~ member(X2,X1) )
| ~ identity(X0,X1) ),
inference(ennf_transformation,[],[f37]) ).
fof(f37,plain,
! [X0,X1] :
( identity(X0,X1)
=> ! [X2] :
( member(X2,X1)
=> apply(X0,X2,X2) ) ),
inference(unused_predicate_definition_removal,[],[f33]) ).
fof(f33,plain,
! [X0,X1] :
( identity(X0,X1)
<=> ! [X2] :
( member(X2,X1)
=> apply(X0,X2,X2) ) ),
inference(rectify,[],[f16]) ).
fof(f16,axiom,
! [X5,X0] :
( identity(X5,X0)
<=> ! [X2] :
( member(X2,X0)
=> apply(X5,X2,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',identity) ).
fof(f59,plain,
identity(compose_function(sK1,sK0,sK3,sK2,sK3),sK3),
inference(cnf_transformation,[],[f48]) ).
fof(f48,plain,
( ~ surjective(sK1,sK2,sK3)
& identity(compose_function(sK1,sK0,sK3,sK2,sK3),sK3)
& maps(sK0,sK3,sK2)
& maps(sK1,sK2,sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f40,f47]) ).
fof(f47,plain,
( ? [X0,X1,X2,X3] :
( ~ surjective(X1,X2,X3)
& identity(compose_function(X1,X0,X3,X2,X3),X3)
& maps(X0,X3,X2)
& maps(X1,X2,X3) )
=> ( ~ surjective(sK1,sK2,sK3)
& identity(compose_function(sK1,sK0,sK3,sK2,sK3),sK3)
& maps(sK0,sK3,sK2)
& maps(sK1,sK2,sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f40,plain,
? [X0,X1,X2,X3] :
( ~ surjective(X1,X2,X3)
& identity(compose_function(X1,X0,X3,X2,X3),X3)
& maps(X0,X3,X2)
& maps(X1,X2,X3) ),
inference(flattening,[],[f39]) ).
fof(f39,plain,
? [X0,X1,X2,X3] :
( ~ surjective(X1,X2,X3)
& identity(compose_function(X1,X0,X3,X2,X3),X3)
& maps(X0,X3,X2)
& maps(X1,X2,X3) ),
inference(ennf_transformation,[],[f31]) ).
fof(f31,plain,
~ ! [X0,X1,X2,X3] :
( ( identity(compose_function(X1,X0,X3,X2,X3),X3)
& maps(X0,X3,X2)
& maps(X1,X2,X3) )
=> surjective(X1,X2,X3) ),
inference(rectify,[],[f30]) ).
fof(f30,negated_conjecture,
~ ! [X5,X9,X0,X1] :
( ( identity(compose_function(X9,X5,X1,X0,X1),X1)
& maps(X5,X1,X0)
& maps(X9,X0,X1) )
=> surjective(X9,X0,X1) ),
inference(negated_conjecture,[],[f29]) ).
fof(f29,conjecture,
! [X5,X9,X0,X1] :
( ( identity(compose_function(X9,X5,X1,X0,X1),X1)
& maps(X5,X1,X0)
& maps(X9,X0,X1) )
=> surjective(X9,X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thII25) ).
fof(f71,plain,
member(sK6(sK1,sK2,sK3),sK3),
inference(unit_resulting_resolution,[],[f60,f69]) ).
fof(f69,plain,
! [X2,X0,X1] :
( member(sK6(X0,X1,X2),X2)
| surjective(X0,X1,X2) ),
inference(cnf_transformation,[],[f56]) ).
fof(f56,plain,
! [X0,X1,X2] :
( surjective(X0,X1,X2)
| ( ! [X4] :
( ~ apply(X0,X4,sK6(X0,X1,X2))
| ~ member(X4,X1) )
& member(sK6(X0,X1,X2),X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f46,f55]) ).
fof(f55,plain,
! [X0,X1,X2] :
( ? [X3] :
( ! [X4] :
( ~ apply(X0,X4,X3)
| ~ member(X4,X1) )
& member(X3,X2) )
=> ( ! [X4] :
( ~ apply(X0,X4,sK6(X0,X1,X2))
| ~ member(X4,X1) )
& member(sK6(X0,X1,X2),X2) ) ),
introduced(choice_axiom,[]) ).
fof(f46,plain,
! [X0,X1,X2] :
( surjective(X0,X1,X2)
| ? [X3] :
( ! [X4] :
( ~ apply(X0,X4,X3)
| ~ member(X4,X1) )
& member(X3,X2) ) ),
inference(ennf_transformation,[],[f36]) ).
fof(f36,plain,
! [X0,X1,X2] :
( ! [X3] :
( member(X3,X2)
=> ? [X4] :
( apply(X0,X4,X3)
& member(X4,X1) ) )
=> surjective(X0,X1,X2) ),
inference(unused_predicate_definition_removal,[],[f35]) ).
fof(f35,plain,
! [X0,X1,X2] :
( surjective(X0,X1,X2)
<=> ! [X3] :
( member(X3,X2)
=> ? [X4] :
( apply(X0,X4,X3)
& member(X4,X1) ) ) ),
inference(rectify,[],[f18]) ).
fof(f18,axiom,
! [X5,X0,X1] :
( surjective(X5,X0,X1)
<=> ! [X4] :
( member(X4,X1)
=> ? [X3] :
( apply(X5,X3,X4)
& member(X3,X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',surjective) ).
fof(f60,plain,
~ surjective(sK1,sK2,sK3),
inference(cnf_transformation,[],[f48]) ).
fof(f96,plain,
~ apply(sK1,sK5(sK1,sK0,sK2,sK6(sK1,sK2,sK3),sK6(sK1,sK2,sK3)),sK6(sK1,sK2,sK3)),
inference(unit_resulting_resolution,[],[f60,f91,f70]) ).
fof(f70,plain,
! [X2,X0,X1,X4] :
( ~ apply(X0,X4,sK6(X0,X1,X2))
| surjective(X0,X1,X2)
| ~ member(X4,X1) ),
inference(cnf_transformation,[],[f56]) ).
fof(f91,plain,
member(sK5(sK1,sK0,sK2,sK6(sK1,sK2,sK3),sK6(sK1,sK2,sK3)),sK2),
inference(unit_resulting_resolution,[],[f71,f71,f73,f65]) ).
fof(f65,plain,
! [X2,X3,X0,X1,X6,X4,X5] :
( member(sK5(X0,X1,X3,X5,X6),X3)
| ~ apply(compose_function(X0,X1,X2,X3,X4),X5,X6)
| ~ member(X6,X4)
| ~ member(X5,X2) ),
inference(cnf_transformation,[],[f54]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SET734+4 : TPTP v8.2.0. Bugfixed v2.2.1.
% 0.03/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.12/0.33 % Computer : n013.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon May 20 11:21:53 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.34 This is a FOF_THM_RFO_SEQ problem
% 0.12/0.34 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.60/0.76 % (22990)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2995ds/34Mi)
% 0.60/0.76 % (22993)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.60/0.76 % (22994)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2995ds/34Mi)
% 0.60/0.77 % (22996)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2995ds/83Mi)
% 0.60/0.77 % (22997)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2995ds/56Mi)
% 0.60/0.77 % (22994)Refutation not found, incomplete strategy% (22994)------------------------------
% 0.60/0.77 % (22994)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.77 % (22994)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.77
% 0.60/0.77 % (22994)Memory used [KB]: 1149
% 0.60/0.77 % (22994)Time elapsed: 0.002 s
% 0.60/0.77 % (22994)Instructions burned: 5 (million)
% 0.60/0.77 % (22993)First to succeed.
% 0.60/0.77 % (22994)------------------------------
% 0.60/0.77 % (22994)------------------------------
% 0.60/0.77 % (22997)Also succeeded, but the first one will report.
% 0.60/0.77 % (22993)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-22989"
% 0.60/0.77 % (22993)Refutation found. Thanks to Tanya!
% 0.60/0.77 % SZS status Theorem for theBenchmark
% 0.60/0.77 % SZS output start Proof for theBenchmark
% See solution above
% 0.60/0.77 % (22993)------------------------------
% 0.60/0.77 % (22993)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.77 % (22993)Termination reason: Refutation
% 0.60/0.77
% 0.60/0.77 % (22993)Memory used [KB]: 1102
% 0.60/0.77 % (22993)Time elapsed: 0.003 s
% 0.60/0.77 % (22993)Instructions burned: 7 (million)
% 0.60/0.77 % (22989)Success in time 0.428 s
% 0.60/0.77 % Vampire---4.8 exiting
%------------------------------------------------------------------------------