TSTP Solution File: SET017+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET017+1 : TPTP v8.1.2. Bugfixed v5.4.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 : n032.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 03:44:08 EDT 2024
% Result : Theorem 0.45s 0.65s
% Output : Refutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 3
% Syntax : Number of formulae : 28 ( 9 unt; 0 def)
% Number of atoms : 84 ( 41 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 81 ( 25 ~; 21 |; 29 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 40 ( 31 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f106,plain,
$false,
inference(subsumption_resolution,[],[f105,f57]) ).
fof(f57,plain,
member(sK1,universal_class),
inference(cnf_transformation,[],[f52]) ).
fof(f52,plain,
( sK1 != sK2
& unordered_pair(sK0,sK1) = unordered_pair(sK0,sK2)
& member(sK2,universal_class)
& member(sK1,universal_class) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f50,f51]) ).
fof(f51,plain,
( ? [X0,X1,X2] :
( X1 != X2
& unordered_pair(X0,X1) = unordered_pair(X0,X2)
& member(X2,universal_class)
& member(X1,universal_class) )
=> ( sK1 != sK2
& unordered_pair(sK0,sK1) = unordered_pair(sK0,sK2)
& member(sK2,universal_class)
& member(sK1,universal_class) ) ),
introduced(choice_axiom,[]) ).
fof(f50,plain,
? [X0,X1,X2] :
( X1 != X2
& unordered_pair(X0,X1) = unordered_pair(X0,X2)
& member(X2,universal_class)
& member(X1,universal_class) ),
inference(flattening,[],[f49]) ).
fof(f49,plain,
? [X0,X1,X2] :
( X1 != X2
& unordered_pair(X0,X1) = unordered_pair(X0,X2)
& member(X2,universal_class)
& member(X1,universal_class) ),
inference(ennf_transformation,[],[f46]) ).
fof(f46,plain,
~ ! [X0,X1,X2] :
( ( unordered_pair(X0,X1) = unordered_pair(X0,X2)
& member(X2,universal_class)
& member(X1,universal_class) )
=> X1 = X2 ),
inference(rectify,[],[f45]) ).
fof(f45,negated_conjecture,
~ ! [X0,X1,X4] :
( ( unordered_pair(X0,X1) = unordered_pair(X0,X4)
& member(X4,universal_class)
& member(X1,universal_class) )
=> X1 = X4 ),
inference(negated_conjecture,[],[f44]) ).
fof(f44,conjecture,
! [X0,X1,X4] :
( ( unordered_pair(X0,X1) = unordered_pair(X0,X4)
& member(X4,universal_class)
& member(X1,universal_class) )
=> X1 = X4 ),
file('/export/starexec/sandbox2/tmp/tmp.mhglRTxEmt/Vampire---4.8_27256',left_cancellation) ).
fof(f105,plain,
~ member(sK1,universal_class),
inference(subsumption_resolution,[],[f102,f60]) ).
fof(f60,plain,
sK1 != sK2,
inference(cnf_transformation,[],[f52]) ).
fof(f102,plain,
( sK1 = sK2
| ~ member(sK1,universal_class) ),
inference(resolution,[],[f101,f75]) ).
fof(f75,plain,
! [X2,X1] :
( member(X2,unordered_pair(X1,X2))
| ~ member(X2,universal_class) ),
inference(equality_resolution,[],[f67]) ).
fof(f67,plain,
! [X2,X0,X1] :
( member(X0,unordered_pair(X1,X2))
| X0 != X2
| ~ member(X0,universal_class) ),
inference(cnf_transformation,[],[f54]) ).
fof(f54,plain,
! [X0,X1,X2] :
( ( member(X0,unordered_pair(X1,X2))
| ( X0 != X2
& X0 != X1 )
| ~ member(X0,universal_class) )
& ( ( ( X0 = X2
| X0 = X1 )
& member(X0,universal_class) )
| ~ member(X0,unordered_pair(X1,X2)) ) ),
inference(flattening,[],[f53]) ).
fof(f53,plain,
! [X0,X1,X2] :
( ( member(X0,unordered_pair(X1,X2))
| ( X0 != X2
& X0 != X1 )
| ~ member(X0,universal_class) )
& ( ( ( X0 = X2
| X0 = X1 )
& member(X0,universal_class) )
| ~ member(X0,unordered_pair(X1,X2)) ) ),
inference(nnf_transformation,[],[f47]) ).
fof(f47,plain,
! [X0,X1,X2] :
( member(X0,unordered_pair(X1,X2))
<=> ( ( X0 = X2
| X0 = X1 )
& member(X0,universal_class) ) ),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
! [X2,X0,X1] :
( member(X2,unordered_pair(X0,X1))
<=> ( ( X1 = X2
| X0 = X2 )
& member(X2,universal_class) ) ),
file('/export/starexec/sandbox2/tmp/tmp.mhglRTxEmt/Vampire---4.8_27256',unordered_pair_defn) ).
fof(f101,plain,
! [X0] :
( ~ member(X0,unordered_pair(sK2,sK1))
| sK2 = X0 ),
inference(duplicate_literal_removal,[],[f91]) ).
fof(f91,plain,
! [X0] :
( ~ member(X0,unordered_pair(sK2,sK1))
| sK2 = X0
| sK2 = X0 ),
inference(superposition,[],[f65,f87]) ).
fof(f87,plain,
unordered_pair(sK2,sK1) = unordered_pair(sK2,sK2),
inference(superposition,[],[f59,f85]) ).
fof(f85,plain,
sK0 = sK2,
inference(subsumption_resolution,[],[f84,f60]) ).
fof(f84,plain,
( sK0 = sK2
| sK1 = sK2 ),
inference(resolution,[],[f82,f65]) ).
fof(f82,plain,
member(sK2,unordered_pair(sK0,sK1)),
inference(subsumption_resolution,[],[f80,f58]) ).
fof(f58,plain,
member(sK2,universal_class),
inference(cnf_transformation,[],[f52]) ).
fof(f80,plain,
( member(sK2,unordered_pair(sK0,sK1))
| ~ member(sK2,universal_class) ),
inference(superposition,[],[f75,f59]) ).
fof(f59,plain,
unordered_pair(sK0,sK1) = unordered_pair(sK0,sK2),
inference(cnf_transformation,[],[f52]) ).
fof(f65,plain,
! [X2,X0,X1] :
( ~ member(X0,unordered_pair(X1,X2))
| X0 = X1
| X0 = X2 ),
inference(cnf_transformation,[],[f54]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : SET017+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.08/0.09 % 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.08/0.28 % Computer : n032.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 300
% 0.08/0.28 % WCLimit : 300
% 0.08/0.28 % DateTime : Tue Apr 30 17:23:06 EDT 2024
% 0.08/0.28 % CPUTime :
% 0.08/0.28 This is a FOF_THM_RFO_SEQ problem
% 0.08/0.28 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.mhglRTxEmt/Vampire---4.8_27256
% 0.45/0.64 % (27428)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.45/0.64 % (27433)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.45/0.64 % (27431)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.45/0.64 % (27433)Refutation not found, incomplete strategy% (27433)------------------------------
% 0.45/0.64 % (27433)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.45/0.64 % (27433)Termination reason: Refutation not found, incomplete strategy
% 0.45/0.64
% 0.45/0.64 % (27433)Memory used [KB]: 1054
% 0.45/0.64 % (27433)Time elapsed: 0.002 s
% 0.45/0.64 % (27433)Instructions burned: 2 (million)
% 0.45/0.64 % (27433)------------------------------
% 0.45/0.64 % (27433)------------------------------
% 0.45/0.64 % (27432)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.45/0.64 % (27426)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.45/0.64 % (27427)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.45/0.64 % (27430)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.45/0.64 % (27431)First to succeed.
% 0.45/0.65 % (27435)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on Vampire---4 for (2996ds/55Mi)
% 0.45/0.65 % (27431)Refutation found. Thanks to Tanya!
% 0.45/0.65 % SZS status Theorem for Vampire---4
% 0.45/0.65 % SZS output start Proof for Vampire---4
% See solution above
% 0.45/0.65 % (27431)------------------------------
% 0.45/0.65 % (27431)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.45/0.65 % (27431)Termination reason: Refutation
% 0.45/0.65
% 0.45/0.65 % (27431)Memory used [KB]: 1067
% 0.45/0.65 % (27431)Time elapsed: 0.004 s
% 0.45/0.65 % (27431)Instructions burned: 4 (million)
% 0.45/0.65 % (27431)------------------------------
% 0.45/0.65 % (27431)------------------------------
% 0.45/0.65 % (27411)Success in time 0.359 s
% 0.45/0.65 % Vampire---4.8 exiting
%------------------------------------------------------------------------------