TSTP Solution File: SET072+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET072+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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n011.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:46 EDT 2024
% Result : Theorem 0.61s 0.76s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% Syntax : Number of formulae : 22 ( 10 unt; 0 def)
% Number of atoms : 51 ( 24 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 40 ( 11 ~; 10 |; 14 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 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 : 31 ( 25 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f241,plain,
$false,
inference(subsumption_resolution,[],[f236,f55]) ).
fof(f55,plain,
sK0 != sK1,
inference(cnf_transformation,[],[f50]) ).
fof(f50,plain,
? [X0,X1,X2] :
( X0 != X1
& unordered_pair(X0,X2) = unordered_pair(X1,X2)
& member(X1,universal_class)
& member(X0,universal_class) ),
inference(flattening,[],[f49]) ).
fof(f49,plain,
? [X0,X1,X2] :
( X0 != X1
& unordered_pair(X0,X2) = unordered_pair(X1,X2)
& member(X1,universal_class)
& member(X0,universal_class) ),
inference(ennf_transformation,[],[f46]) ).
fof(f46,plain,
~ ! [X0,X1,X2] :
( ( unordered_pair(X0,X2) = unordered_pair(X1,X2)
& member(X1,universal_class)
& member(X0,universal_class) )
=> X0 = X1 ),
inference(rectify,[],[f45]) ).
fof(f45,negated_conjecture,
~ ! [X0,X1,X4] :
( ( unordered_pair(X0,X4) = unordered_pair(X1,X4)
& member(X1,universal_class)
& member(X0,universal_class) )
=> X0 = X1 ),
inference(negated_conjecture,[],[f44]) ).
fof(f44,conjecture,
! [X0,X1,X4] :
( ( unordered_pair(X0,X4) = unordered_pair(X1,X4)
& member(X1,universal_class)
& member(X0,universal_class) )
=> X0 = X1 ),
file('/export/starexec/sandbox/tmp/tmp.AZQ4xYKqkB/Vampire---4.8_17734',right_cancellation) ).
fof(f236,plain,
sK0 = sK1,
inference(superposition,[],[f222,f198]) ).
fof(f198,plain,
sK1 = sK2,
inference(unit_resulting_resolution,[],[f55,f125,f64]) ).
fof(f64,plain,
! [X2,X0,X1] :
( ~ member(X0,unordered_pair(X1,X2))
| X0 = X2
| X0 = X1 ),
inference(cnf_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/sandbox/tmp/tmp.AZQ4xYKqkB/Vampire---4.8_17734',unordered_pair_defn) ).
fof(f125,plain,
member(sK1,unordered_pair(sK0,sK2)),
inference(subsumption_resolution,[],[f120,f53]) ).
fof(f53,plain,
member(sK1,universal_class),
inference(cnf_transformation,[],[f50]) ).
fof(f120,plain,
( member(sK1,unordered_pair(sK0,sK2))
| ~ member(sK1,universal_class) ),
inference(superposition,[],[f80,f54]) ).
fof(f54,plain,
unordered_pair(sK0,sK2) = unordered_pair(sK1,sK2),
inference(cnf_transformation,[],[f50]) ).
fof(f80,plain,
! [X2,X1] :
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
inference(equality_resolution,[],[f62]) ).
fof(f62,plain,
! [X2,X0,X1] :
( ~ member(X0,universal_class)
| X0 != X1
| member(X0,unordered_pair(X1,X2)) ),
inference(cnf_transformation,[],[f47]) ).
fof(f222,plain,
sK0 = sK2,
inference(unit_resulting_resolution,[],[f55,f81,f122]) ).
fof(f122,plain,
! [X0] :
( ~ member(X0,unordered_pair(sK0,sK2))
| sK2 = X0
| sK1 = X0 ),
inference(superposition,[],[f64,f54]) ).
fof(f81,plain,
! [X0] : member(sK0,unordered_pair(sK0,X0)),
inference(unit_resulting_resolution,[],[f52,f80]) ).
fof(f52,plain,
member(sK0,universal_class),
inference(cnf_transformation,[],[f50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SET072+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.03/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 : n011.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.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Tue Apr 30 17:17:31 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.37 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.37 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.AZQ4xYKqkB/Vampire---4.8_17734
% 0.59/0.76 % (17987)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.59/0.76 % (17981)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.59/0.76 % (17984)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.59/0.76 % (17985)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.59/0.76 % (17983)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.59/0.76 % (17986)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.59/0.76 % (17987)First to succeed.
% 0.59/0.76 % (17984)Refutation not found, incomplete strategy% (17984)------------------------------
% 0.59/0.76 % (17984)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.59/0.76 % (17984)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.76
% 0.59/0.76 % (17984)Memory used [KB]: 1058
% 0.59/0.76 % (17984)Time elapsed: 0.004 s
% 0.59/0.76 % (17984)Instructions burned: 4 (million)
% 0.59/0.76 % (17984)------------------------------
% 0.59/0.76 % (17984)------------------------------
% 0.59/0.76 % (17988)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.61/0.76 % (17982)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.61/0.76 % (17987)Refutation found. Thanks to Tanya!
% 0.61/0.76 % SZS status Theorem for Vampire---4
% 0.61/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.76 % (17987)------------------------------
% 0.61/0.76 % (17987)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.76 % (17987)Termination reason: Refutation
% 0.61/0.76
% 0.61/0.76 % (17987)Memory used [KB]: 1102
% 0.61/0.76 % (17987)Time elapsed: 0.005 s
% 0.61/0.76 % (17987)Instructions burned: 10 (million)
% 0.61/0.76 % (17987)------------------------------
% 0.61/0.76 % (17987)------------------------------
% 0.61/0.76 % (17977)Success in time 0.383 s
% 0.61/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------