TSTP Solution File: SWV390+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWV390+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 : n024.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:27 EDT 2024
% Result : Theorem 0.62s 0.83s
% Output : Refutation 0.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 30 ( 8 unt; 0 def)
% Number of atoms : 85 ( 12 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 97 ( 42 ~; 27 |; 19 &)
% ( 3 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-3 aty)
% Number of variables : 101 ( 85 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f305,plain,
$false,
inference(subsumption_resolution,[],[f303,f167]) ).
fof(f167,plain,
pair_in_list(sK3,sK0(sK3),sK1(sK3)),
inference(resolution,[],[f98,f100]) ).
fof(f100,plain,
~ check_cpq(triple(sK2,sK3,sK4)),
inference(cnf_transformation,[],[f91]) ).
fof(f91,plain,
( check_cpq(insert_cpq(triple(sK2,sK3,sK4),sK5))
& ~ check_cpq(triple(sK2,sK3,sK4)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5])],[f55,f90,f89]) ).
fof(f89,plain,
( ? [X0,X1,X2] :
( ? [X3] : check_cpq(insert_cpq(triple(X0,X1,X2),X3))
& ~ check_cpq(triple(X0,X1,X2)) )
=> ( ? [X3] : check_cpq(insert_cpq(triple(sK2,sK3,sK4),X3))
& ~ check_cpq(triple(sK2,sK3,sK4)) ) ),
introduced(choice_axiom,[]) ).
fof(f90,plain,
( ? [X3] : check_cpq(insert_cpq(triple(sK2,sK3,sK4),X3))
=> check_cpq(insert_cpq(triple(sK2,sK3,sK4),sK5)) ),
introduced(choice_axiom,[]) ).
fof(f55,plain,
? [X0,X1,X2] :
( ? [X3] : check_cpq(insert_cpq(triple(X0,X1,X2),X3))
& ~ check_cpq(triple(X0,X1,X2)) ),
inference(ennf_transformation,[],[f44]) ).
fof(f44,negated_conjecture,
~ ! [X0,X1,X2] :
( ~ check_cpq(triple(X0,X1,X2))
=> ! [X3] : ~ check_cpq(insert_cpq(triple(X0,X1,X2),X3)) ),
inference(negated_conjecture,[],[f43]) ).
fof(f43,conjecture,
! [X0,X1,X2] :
( ~ check_cpq(triple(X0,X1,X2))
=> ! [X3] : ~ check_cpq(insert_cpq(triple(X0,X1,X2),X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.aFdICn7lSb/Vampire---4.8_11035',l26_co) ).
fof(f98,plain,
! [X2,X0,X1] :
( check_cpq(triple(X0,X1,X2))
| pair_in_list(X1,sK0(X1),sK1(X1)) ),
inference(cnf_transformation,[],[f88]) ).
fof(f88,plain,
! [X0,X1,X2] :
( ( check_cpq(triple(X0,X1,X2))
| ( ~ less_than(sK1(X1),sK0(X1))
& pair_in_list(X1,sK0(X1),sK1(X1)) ) )
& ( ! [X5,X6] :
( less_than(X6,X5)
| ~ pair_in_list(X1,X5,X6) )
| ~ check_cpq(triple(X0,X1,X2)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f86,f87]) ).
fof(f87,plain,
! [X1] :
( ? [X3,X4] :
( ~ less_than(X4,X3)
& pair_in_list(X1,X3,X4) )
=> ( ~ less_than(sK1(X1),sK0(X1))
& pair_in_list(X1,sK0(X1),sK1(X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f86,plain,
! [X0,X1,X2] :
( ( check_cpq(triple(X0,X1,X2))
| ? [X3,X4] :
( ~ less_than(X4,X3)
& pair_in_list(X1,X3,X4) ) )
& ( ! [X5,X6] :
( less_than(X6,X5)
| ~ pair_in_list(X1,X5,X6) )
| ~ check_cpq(triple(X0,X1,X2)) ) ),
inference(rectify,[],[f85]) ).
fof(f85,plain,
! [X0,X1,X2] :
( ( check_cpq(triple(X0,X1,X2))
| ? [X3,X4] :
( ~ less_than(X4,X3)
& pair_in_list(X1,X3,X4) ) )
& ( ! [X3,X4] :
( less_than(X4,X3)
| ~ pair_in_list(X1,X3,X4) )
| ~ check_cpq(triple(X0,X1,X2)) ) ),
inference(nnf_transformation,[],[f54]) ).
fof(f54,plain,
! [X0,X1,X2] :
( check_cpq(triple(X0,X1,X2))
<=> ! [X3,X4] :
( less_than(X4,X3)
| ~ pair_in_list(X1,X3,X4) ) ),
inference(ennf_transformation,[],[f42]) ).
fof(f42,axiom,
! [X0,X1,X2] :
( check_cpq(triple(X0,X1,X2))
<=> ! [X3,X4] :
( pair_in_list(X1,X3,X4)
=> less_than(X4,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.aFdICn7lSb/Vampire---4.8_11035',l26_li4142) ).
fof(f303,plain,
~ pair_in_list(sK3,sK0(sK3),sK1(sK3)),
inference(resolution,[],[f301,f101]) ).
fof(f101,plain,
check_cpq(insert_cpq(triple(sK2,sK3,sK4),sK5)),
inference(cnf_transformation,[],[f91]) ).
fof(f301,plain,
! [X2,X3,X0,X1] :
( ~ check_cpq(insert_cpq(triple(X0,X2,X3),X1))
| ~ pair_in_list(X2,sK0(sK3),sK1(sK3)) ),
inference(superposition,[],[f177,f114]) ).
fof(f114,plain,
! [X2,X3,X0,X1] : insert_cpq(triple(X0,X1,X2),X3) = triple(insert_pqp(X0,X3),insert_slb(X1,pair(X3,bottom)),X2),
inference(cnf_transformation,[],[f30]) ).
fof(f30,axiom,
! [X0,X1,X2,X3] : insert_cpq(triple(X0,X1,X2),X3) = triple(insert_pqp(X0,X3),insert_slb(X1,pair(X3,bottom)),X2),
file('/export/starexec/sandbox2/tmp/tmp.aFdICn7lSb/Vampire---4.8_11035',ax42) ).
fof(f177,plain,
! [X2,X3,X0,X1,X4] :
( ~ check_cpq(triple(X1,insert_slb(X0,pair(X2,X3)),X4))
| ~ pair_in_list(X0,sK0(sK3),sK1(sK3)) ),
inference(resolution,[],[f107,f173]) ).
fof(f173,plain,
! [X2,X0,X1] :
( ~ pair_in_list(X0,sK0(sK3),sK1(sK3))
| ~ check_cpq(triple(X1,X0,X2)) ),
inference(resolution,[],[f97,f156]) ).
fof(f156,plain,
~ less_than(sK1(sK3),sK0(sK3)),
inference(resolution,[],[f99,f100]) ).
fof(f99,plain,
! [X2,X0,X1] :
( check_cpq(triple(X0,X1,X2))
| ~ less_than(sK1(X1),sK0(X1)) ),
inference(cnf_transformation,[],[f88]) ).
fof(f97,plain,
! [X2,X0,X1,X6,X5] :
( less_than(X6,X5)
| ~ pair_in_list(X1,X5,X6)
| ~ check_cpq(triple(X0,X1,X2)) ),
inference(cnf_transformation,[],[f88]) ).
fof(f107,plain,
! [X2,X3,X0,X1,X4] :
( pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
| ~ pair_in_list(X0,X2,X4) ),
inference(cnf_transformation,[],[f93]) ).
fof(f93,plain,
! [X0,X1,X2,X3,X4] :
( ( pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
| ( ( X3 != X4
| X1 != X2 )
& ~ pair_in_list(X0,X2,X4) ) )
& ( ( X3 = X4
& X1 = X2 )
| pair_in_list(X0,X2,X4)
| ~ pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4) ) ),
inference(flattening,[],[f92]) ).
fof(f92,plain,
! [X0,X1,X2,X3,X4] :
( ( pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
| ( ( X3 != X4
| X1 != X2 )
& ~ pair_in_list(X0,X2,X4) ) )
& ( ( X3 = X4
& X1 = X2 )
| pair_in_list(X0,X2,X4)
| ~ pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4) ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f11,axiom,
! [X0,X1,X2,X3,X4] :
( pair_in_list(insert_slb(X0,pair(X1,X3)),X2,X4)
<=> ( ( X3 = X4
& X1 = X2 )
| pair_in_list(X0,X2,X4) ) ),
file('/export/starexec/sandbox2/tmp/tmp.aFdICn7lSb/Vampire---4.8_11035',ax23) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWV390+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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.36 % Computer : n024.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 20:59:23 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.aFdICn7lSb/Vampire---4.8_11035
% 0.62/0.81 % (11272)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.62/0.81 % (11277)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 (2995ds/56Mi)
% 0.62/0.81 % (11269)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 (2995ds/34Mi)
% 0.62/0.81 % (11271)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.62/0.81 % (11270)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 (2995ds/51Mi)
% 0.62/0.81 % (11274)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 (2995ds/34Mi)
% 0.62/0.81 % (11275)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.62/0.81 % (11276)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 (2995ds/83Mi)
% 0.62/0.83 % (11271)First to succeed.
% 0.62/0.83 % (11272)Instruction limit reached!
% 0.62/0.83 % (11272)------------------------------
% 0.62/0.83 % (11272)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.83 % (11272)Termination reason: Unknown
% 0.62/0.83 % (11272)Termination phase: Saturation
% 0.62/0.83
% 0.62/0.83 % (11272)Memory used [KB]: 1474
% 0.62/0.83 % (11272)Time elapsed: 0.016 s
% 0.62/0.83 % (11272)Instructions burned: 33 (million)
% 0.62/0.83 % (11272)------------------------------
% 0.62/0.83 % (11272)------------------------------
% 0.62/0.83 % (11271)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-11173"
% 0.62/0.83 % (11271)Refutation found. Thanks to Tanya!
% 0.62/0.83 % SZS status Theorem for Vampire---4
% 0.62/0.83 % SZS output start Proof for Vampire---4
% See solution above
% 0.62/0.83 % (11271)------------------------------
% 0.62/0.83 % (11271)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.83 % (11271)Termination reason: Refutation
% 0.62/0.83
% 0.62/0.83 % (11271)Memory used [KB]: 1200
% 0.62/0.83 % (11271)Time elapsed: 0.015 s
% 0.62/0.83 % (11271)Instructions burned: 21 (million)
% 0.62/0.83 % (11173)Success in time 0.446 s
% 0.62/0.83 % Vampire---4.8 exiting
%------------------------------------------------------------------------------