TSTP Solution File: SWV383+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWV383+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/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 : Sun May 5 10:29:25 EDT 2024
% Result : Theorem 0.57s 0.74s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 6 unt; 0 def)
% Number of atoms : 64 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 74 ( 29 ~; 16 |; 21 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-3 aty)
% Number of variables : 60 ( 36 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f93,plain,
$false,
inference(subsumption_resolution,[],[f92,f69]) ).
fof(f69,plain,
~ check_cpq(triple(sK0,sK1,sK2)),
inference(cnf_transformation,[],[f65]) ).
fof(f65,plain,
( check_cpq(triple(sK3,sK4,sK5))
& ok(triple(sK3,sK4,sK5))
& succ_cpq(triple(sK0,sK1,sK2),triple(sK3,sK4,sK5))
& ~ check_cpq(triple(sK0,sK1,sK2)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f54,f64,f63]) ).
fof(f63,plain,
( ? [X0,X1,X2] :
( ? [X3,X4,X5] :
( check_cpq(triple(X3,X4,X5))
& ok(triple(X3,X4,X5))
& succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5)) )
& ~ check_cpq(triple(X0,X1,X2)) )
=> ( ? [X5,X4,X3] :
( check_cpq(triple(X3,X4,X5))
& ok(triple(X3,X4,X5))
& succ_cpq(triple(sK0,sK1,sK2),triple(X3,X4,X5)) )
& ~ check_cpq(triple(sK0,sK1,sK2)) ) ),
introduced(choice_axiom,[]) ).
fof(f64,plain,
( ? [X5,X4,X3] :
( check_cpq(triple(X3,X4,X5))
& ok(triple(X3,X4,X5))
& succ_cpq(triple(sK0,sK1,sK2),triple(X3,X4,X5)) )
=> ( check_cpq(triple(sK3,sK4,sK5))
& ok(triple(sK3,sK4,sK5))
& succ_cpq(triple(sK0,sK1,sK2),triple(sK3,sK4,sK5)) ) ),
introduced(choice_axiom,[]) ).
fof(f54,plain,
? [X0,X1,X2] :
( ? [X3,X4,X5] :
( check_cpq(triple(X3,X4,X5))
& ok(triple(X3,X4,X5))
& succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5)) )
& ~ check_cpq(triple(X0,X1,X2)) ),
inference(flattening,[],[f53]) ).
fof(f53,plain,
? [X0,X1,X2] :
( ? [X3,X4,X5] :
( check_cpq(triple(X3,X4,X5))
& ok(triple(X3,X4,X5))
& succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5)) )
& ~ check_cpq(triple(X0,X1,X2)) ),
inference(ennf_transformation,[],[f44]) ).
fof(f44,negated_conjecture,
~ ! [X0,X1,X2] :
( ~ check_cpq(triple(X0,X1,X2))
=> ! [X3,X4,X5] :
( succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
=> ( ~ check_cpq(triple(X3,X4,X5))
| ~ ok(triple(X3,X4,X5)) ) ) ),
inference(negated_conjecture,[],[f43]) ).
fof(f43,conjecture,
! [X0,X1,X2] :
( ~ check_cpq(triple(X0,X1,X2))
=> ! [X3,X4,X5] :
( succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
=> ( ~ check_cpq(triple(X3,X4,X5))
| ~ ok(triple(X3,X4,X5)) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ZRGrU4WR4k/Vampire---4.8_9831',l19_co) ).
fof(f92,plain,
check_cpq(triple(sK0,sK1,sK2)),
inference(subsumption_resolution,[],[f91,f72]) ).
fof(f72,plain,
check_cpq(triple(sK3,sK4,sK5)),
inference(cnf_transformation,[],[f65]) ).
fof(f91,plain,
( ~ check_cpq(triple(sK3,sK4,sK5))
| check_cpq(triple(sK0,sK1,sK2)) ),
inference(subsumption_resolution,[],[f89,f71]) ).
fof(f71,plain,
ok(triple(sK3,sK4,sK5)),
inference(cnf_transformation,[],[f65]) ).
fof(f89,plain,
( ~ ok(triple(sK3,sK4,sK5))
| ~ check_cpq(triple(sK3,sK4,sK5))
| check_cpq(triple(sK0,sK1,sK2)) ),
inference(resolution,[],[f67,f70]) ).
fof(f70,plain,
succ_cpq(triple(sK0,sK1,sK2),triple(sK3,sK4,sK5)),
inference(cnf_transformation,[],[f65]) ).
fof(f67,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
| ~ ok(triple(X3,X4,X5))
| ~ check_cpq(triple(X3,X4,X5))
| check_cpq(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f52]) ).
fof(f52,plain,
! [X0,X1,X2] :
( ! [X3,X4,X5] :
( ~ check_cpq(triple(X3,X4,X5))
| ~ ok(triple(X3,X4,X5))
| ~ succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5)) )
| ( ok(triple(X0,X1,X2))
& check_cpq(triple(X0,X1,X2)) ) ),
inference(flattening,[],[f51]) ).
fof(f51,plain,
! [X0,X1,X2] :
( ! [X3,X4,X5] :
( ~ check_cpq(triple(X3,X4,X5))
| ~ ok(triple(X3,X4,X5))
| ~ succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5)) )
| ( ok(triple(X0,X1,X2))
& check_cpq(triple(X0,X1,X2)) ) ),
inference(ennf_transformation,[],[f42]) ).
fof(f42,axiom,
! [X0,X1,X2] :
( ( ~ ok(triple(X0,X1,X2))
| ~ check_cpq(triple(X0,X1,X2)) )
=> ! [X3,X4,X5] :
( succ_cpq(triple(X0,X1,X2),triple(X3,X4,X5))
=> ( ~ check_cpq(triple(X3,X4,X5))
| ~ ok(triple(X3,X4,X5)) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ZRGrU4WR4k/Vampire---4.8_9831',l19_l20) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWV383+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.36 % Computer : n013.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 : Fri May 3 21:14:08 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.36 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.ZRGrU4WR4k/Vampire---4.8_9831
% 0.57/0.73 % (10037)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.57/0.73 % (10039)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2996ds/56Mi)
% 0.57/0.74 % (10039)First to succeed.
% 0.57/0.74 % (10037)Also succeeded, but the first one will report.
% 0.57/0.74 % (10032)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 Vampire---4 for (2996ds/34Mi)
% 0.57/0.74 % (10034)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.57/0.74 % (10033)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2996ds/51Mi)
% 0.57/0.74 % (10035)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.57/0.74 % (10036)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 Vampire---4 for (2996ds/34Mi)
% 0.57/0.74 % (10039)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-9971"
% 0.57/0.74 % (10038)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 Vampire---4 for (2996ds/83Mi)
% 0.57/0.74 % (10039)Refutation found. Thanks to Tanya!
% 0.57/0.74 % SZS status Theorem for Vampire---4
% 0.57/0.74 % SZS output start Proof for Vampire---4
% See solution above
% 0.57/0.74 % (10039)------------------------------
% 0.57/0.74 % (10039)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.74 % (10039)Termination reason: Refutation
% 0.57/0.74
% 0.57/0.74 % (10039)Memory used [KB]: 1082
% 0.57/0.74 % (10039)Time elapsed: 0.002 s
% 0.57/0.74 % (10039)Instructions burned: 4 (million)
% 0.57/0.74 % (9971)Success in time 0.368 s
% 0.57/0.74 % Vampire---4.8 exiting
%------------------------------------------------------------------------------