TSTP Solution File: SWV409+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWV409+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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n012.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 : Wed May 1 04:03:51 EDT 2024
% Result : Theorem 0.60s 0.76s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 32 ( 10 unt; 0 def)
% Number of atoms : 89 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 95 ( 38 ~; 33 |; 18 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 72 ( 59 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f211,plain,
$false,
inference(subsumption_resolution,[],[f201,f173]) ).
fof(f173,plain,
~ pair_in_list(update_slb(sK2,sK4),sK3,sK1(sK2,sK3,sK4)),
inference(unit_resulting_resolution,[],[f156,f39]) ).
fof(f39,plain,
! [X3] :
( ~ pair_in_list(update_slb(sK2,sK4),sK3,X3)
| ~ less_than(sK4,X3) ),
inference(cnf_transformation,[],[f30]) ).
fof(f30,plain,
? [X0,X1,X2] :
( ! [X3] :
( ~ less_than(X2,X3)
| ~ pair_in_list(update_slb(X0,X2),X1,X3) )
& ~ pair_in_list(update_slb(X0,X2),X1,X2)
& strictly_less_than(X1,X2)
& contains_slb(X0,X1) ),
inference(flattening,[],[f29]) ).
fof(f29,plain,
? [X0,X1,X2] :
( ! [X3] :
( ~ less_than(X2,X3)
| ~ pair_in_list(update_slb(X0,X2),X1,X3) )
& ~ pair_in_list(update_slb(X0,X2),X1,X2)
& strictly_less_than(X1,X2)
& contains_slb(X0,X1) ),
inference(ennf_transformation,[],[f23]) ).
fof(f23,negated_conjecture,
~ ! [X0,X1,X2] :
( ( strictly_less_than(X1,X2)
& contains_slb(X0,X1) )
=> ( ? [X3] :
( less_than(X2,X3)
& pair_in_list(update_slb(X0,X2),X1,X3) )
| pair_in_list(update_slb(X0,X2),X1,X2) ) ),
inference(negated_conjecture,[],[f22]) ).
fof(f22,conjecture,
! [X0,X1,X2] :
( ( strictly_less_than(X1,X2)
& contains_slb(X0,X1) )
=> ( ? [X3] :
( less_than(X2,X3)
& pair_in_list(update_slb(X0,X2),X1,X3) )
| pair_in_list(update_slb(X0,X2),X1,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.lOGnuiCjK9/Vampire---4.8_25900',l45_co) ).
fof(f156,plain,
less_than(sK4,sK1(sK2,sK3,sK4)),
inference(unit_resulting_resolution,[],[f96,f130,f41,f38]) ).
fof(f38,plain,
! [X2,X3,X0,X1] :
( ~ pair_in_list(X0,X1,X2)
| ~ strictly_less_than(X1,X3)
| ~ less_than(X3,X2)
| less_than(X3,sK1(X0,X1,X3)) ),
inference(cnf_transformation,[],[f28]) ).
fof(f28,plain,
! [X0,X1,X2,X3] :
( ? [X4] :
( less_than(X3,X4)
& pair_in_list(update_slb(X0,X3),X1,X4) )
| ~ less_than(X3,X2)
| ~ strictly_less_than(X1,X3)
| ~ pair_in_list(X0,X1,X2) ),
inference(flattening,[],[f27]) ).
fof(f27,plain,
! [X0,X1,X2,X3] :
( ? [X4] :
( less_than(X3,X4)
& pair_in_list(update_slb(X0,X3),X1,X4) )
| ~ less_than(X3,X2)
| ~ strictly_less_than(X1,X3)
| ~ pair_in_list(X0,X1,X2) ),
inference(ennf_transformation,[],[f21]) ).
fof(f21,axiom,
! [X0,X1,X2,X3] :
( ( less_than(X3,X2)
& strictly_less_than(X1,X3)
& pair_in_list(X0,X1,X2) )
=> ? [X4] :
( less_than(X3,X4)
& pair_in_list(update_slb(X0,X3),X1,X4) ) ),
file('/export/starexec/sandbox/tmp/tmp.lOGnuiCjK9/Vampire---4.8_25900',l45_l49) ).
fof(f41,plain,
strictly_less_than(sK3,sK4),
inference(cnf_transformation,[],[f30]) ).
fof(f130,plain,
less_than(sK4,sK0(sK2,sK3)),
inference(subsumption_resolution,[],[f129,f59]) ).
fof(f59,plain,
! [X0,X1] :
( less_than(X0,X1)
| less_than(X1,X0) ),
inference(cnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] :
( less_than(X1,X0)
| less_than(X0,X1) ),
file('/export/starexec/sandbox/tmp/tmp.lOGnuiCjK9/Vampire---4.8_25900',totality) ).
fof(f129,plain,
( less_than(sK4,sK0(sK2,sK3))
| ~ less_than(sK0(sK2,sK3),sK4) ),
inference(resolution,[],[f121,f55]) ).
fof(f55,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| less_than(X1,X0)
| ~ less_than(X0,X1) ),
inference(cnf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0,X1] :
( strictly_less_than(X0,X1)
<=> ( ~ less_than(X1,X0)
& less_than(X0,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.lOGnuiCjK9/Vampire---4.8_25900',stricly_smaller_definition) ).
fof(f121,plain,
~ strictly_less_than(sK0(sK2,sK3),sK4),
inference(unit_resulting_resolution,[],[f96,f41,f42,f36]) ).
fof(f36,plain,
! [X2,X3,X0,X1] :
( ~ pair_in_list(X0,X1,X2)
| ~ strictly_less_than(X1,X3)
| ~ strictly_less_than(X2,X3)
| pair_in_list(update_slb(X0,X3),X1,X3) ),
inference(cnf_transformation,[],[f26]) ).
fof(f26,plain,
! [X0,X1,X2,X3] :
( pair_in_list(update_slb(X0,X3),X1,X3)
| ~ strictly_less_than(X2,X3)
| ~ strictly_less_than(X1,X3)
| ~ pair_in_list(X0,X1,X2) ),
inference(flattening,[],[f25]) ).
fof(f25,plain,
! [X0,X1,X2,X3] :
( pair_in_list(update_slb(X0,X3),X1,X3)
| ~ strictly_less_than(X2,X3)
| ~ strictly_less_than(X1,X3)
| ~ pair_in_list(X0,X1,X2) ),
inference(ennf_transformation,[],[f20]) ).
fof(f20,axiom,
! [X0,X1,X2,X3] :
( ( strictly_less_than(X2,X3)
& strictly_less_than(X1,X3)
& pair_in_list(X0,X1,X2) )
=> pair_in_list(update_slb(X0,X3),X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.lOGnuiCjK9/Vampire---4.8_25900',l45_l48) ).
fof(f42,plain,
~ pair_in_list(update_slb(sK2,sK4),sK3,sK4),
inference(cnf_transformation,[],[f30]) ).
fof(f96,plain,
pair_in_list(sK2,sK3,sK0(sK2,sK3)),
inference(unit_resulting_resolution,[],[f40,f35]) ).
fof(f35,plain,
! [X0,X1] :
( pair_in_list(X0,X1,sK0(X0,X1))
| ~ contains_slb(X0,X1) ),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1] :
( ? [X2] : pair_in_list(X0,X1,X2)
| ~ contains_slb(X0,X1) ),
inference(ennf_transformation,[],[f19]) ).
fof(f19,axiom,
! [X0,X1] :
( contains_slb(X0,X1)
=> ? [X2] : pair_in_list(X0,X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.lOGnuiCjK9/Vampire---4.8_25900',l45_li4647) ).
fof(f40,plain,
contains_slb(sK2,sK3),
inference(cnf_transformation,[],[f30]) ).
fof(f201,plain,
pair_in_list(update_slb(sK2,sK4),sK3,sK1(sK2,sK3,sK4)),
inference(unit_resulting_resolution,[],[f96,f130,f41,f37]) ).
fof(f37,plain,
! [X2,X3,X0,X1] :
( ~ pair_in_list(X0,X1,X2)
| ~ strictly_less_than(X1,X3)
| ~ less_than(X3,X2)
| pair_in_list(update_slb(X0,X3),X1,sK1(X0,X1,X3)) ),
inference(cnf_transformation,[],[f28]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWV409+1 : TPTP v8.1.2. Released v3.3.0.
% 0.13/0.15 % 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.15/0.36 % Computer : n012.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 : Tue Apr 30 18:23:26 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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.lOGnuiCjK9/Vampire---4.8_25900
% 0.56/0.75 % (26160)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.56/0.75 % (26154)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.56/0.75 % (26157)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.56/0.75 % (26155)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.56/0.75 % (26161)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.56/0.75 % (26156)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.56/0.75 % (26158)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.56/0.75 % (26159)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.56/0.76 % (26160)First to succeed.
% 0.60/0.76 % (26160)Refutation found. Thanks to Tanya!
% 0.60/0.76 % SZS status Theorem for Vampire---4
% 0.60/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.76 % (26160)------------------------------
% 0.60/0.76 % (26160)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.76 % (26160)Termination reason: Refutation
% 0.60/0.76
% 0.60/0.76 % (26160)Memory used [KB]: 1087
% 0.60/0.76 % (26160)Time elapsed: 0.005 s
% 0.60/0.76 % (26160)Instructions burned: 10 (million)
% 0.60/0.76 % (26160)------------------------------
% 0.60/0.76 % (26160)------------------------------
% 0.60/0.76 % (26149)Success in time 0.385 s
% 0.60/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------