TSTP Solution File: SET852-2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET852-2 : TPTP v8.2.0. Released v3.2.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 : n015.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 : Tue May 21 03:13:39 EDT 2024
% Result : Unsatisfiable 0.47s 0.67s
% Output : Refutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 15 ( 4 unt; 0 def)
% Number of atoms : 36 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 27 ( 6 ~; 21 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-4 aty)
% Number of variables : 19 ( 19 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,plain,
$false,
inference(subsumption_resolution,[],[f14,f2]) ).
fof(f2,axiom,
~ c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).
fof(f14,plain,
c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))),
inference(subsumption_resolution,[],[f13,f1]) ).
fof(f1,axiom,
~ c_lessequals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
fof(f13,plain,
( c_lessequals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a)))
| c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))) ),
inference(duplicate_literal_removal,[],[f12]) ).
fof(f12,plain,
( c_lessequals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a)))
| c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a)))
| c_lessequals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))) ),
inference(resolution,[],[f11,f5]) ).
fof(f5,axiom,
! [X2,X3,X1,X4] :
( ~ c_lessequals(c_Zorn_OUnion__lemma0__1(X1,X2,X3,X4),X1,tc_set(X4))
| c_lessequals(X2,c_Union(X3,X4),tc_set(X4))
| c_lessequals(c_Union(X3,X4),X1,tc_set(X4)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_OUnion__lemma0_1) ).
fof(f11,plain,
! [X0] :
( c_lessequals(c_Zorn_OUnion__lemma0__1(X0,c_Zorn_Osucc(v_S,v_m,t_a),v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a)))
| c_lessequals(c_Union(v_Y,tc_set(t_a)),X0,tc_set(tc_set(t_a))) ),
inference(subsumption_resolution,[],[f10,f2]) ).
fof(f10,plain,
! [X0] :
( c_lessequals(c_Zorn_OUnion__lemma0__1(X0,c_Zorn_Osucc(v_S,v_m,t_a),v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a)))
| c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a)))
| c_lessequals(c_Union(v_Y,tc_set(t_a)),X0,tc_set(tc_set(t_a))) ),
inference(duplicate_literal_removal,[],[f9]) ).
fof(f9,plain,
! [X0] :
( c_lessequals(c_Zorn_OUnion__lemma0__1(X0,c_Zorn_Osucc(v_S,v_m,t_a),v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a)))
| c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a)))
| c_lessequals(c_Union(v_Y,tc_set(t_a)),X0,tc_set(tc_set(t_a)))
| c_lessequals(c_Union(v_Y,tc_set(t_a)),X0,tc_set(tc_set(t_a))) ),
inference(resolution,[],[f8,f7]) ).
fof(f7,plain,
! [X0] :
( ~ c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Zorn_OUnion__lemma0__1(X0,c_Zorn_Osucc(v_S,v_m,t_a),v_Y,tc_set(t_a)),tc_set(tc_set(t_a)))
| c_lessequals(c_Union(v_Y,tc_set(t_a)),X0,tc_set(tc_set(t_a))) ),
inference(resolution,[],[f2,f6]) ).
fof(f6,axiom,
! [X2,X3,X1,X4] :
( c_lessequals(X2,c_Union(X3,X4),tc_set(X4))
| c_lessequals(c_Union(X3,X4),X1,tc_set(X4))
| ~ c_lessequals(X2,c_Zorn_OUnion__lemma0__1(X1,X2,X3,X4),tc_set(X4)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_OUnion__lemma0_2) ).
fof(f8,plain,
! [X0,X1] :
( c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Zorn_OUnion__lemma0__1(X0,X1,v_Y,tc_set(t_a)),tc_set(tc_set(t_a)))
| c_lessequals(c_Zorn_OUnion__lemma0__1(X0,X1,v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a)))
| c_lessequals(X1,c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a)))
| c_lessequals(c_Union(v_Y,tc_set(t_a)),X0,tc_set(tc_set(t_a))) ),
inference(resolution,[],[f3,f4]) ).
fof(f4,axiom,
! [X2,X3,X1,X4] :
( c_in(c_Zorn_OUnion__lemma0__1(X1,X2,X3,X4),X3,tc_set(X4))
| c_lessequals(X2,c_Union(X3,X4),tc_set(X4))
| c_lessequals(c_Union(X3,X4),X1,tc_set(X4)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_OUnion__lemma0_0) ).
fof(f3,axiom,
! [X0] :
( ~ c_in(X0,v_Y,tc_set(tc_set(t_a)))
| c_lessequals(X0,v_m,tc_set(tc_set(t_a)))
| c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),X0,tc_set(tc_set(t_a))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_4) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SET852-2 : TPTP v8.2.0. Released v3.2.0.
% 0.08/0.13 % 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.12/0.33 % Computer : n015.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon May 20 11:54:12 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.12/0.33 This is a CNF_UNS_RFO_NEQ_NHN problem
% 0.12/0.34 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/benchmark/theBenchmark.p
% 0.47/0.67 % (21996)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2996ds/56Mi)
% 0.47/0.67 % (21996)First to succeed.
% 0.47/0.67 % (21996)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-21987"
% 0.47/0.67 % (21995)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 theBenchmark for (2996ds/83Mi)
% 0.47/0.67 % (21989)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 theBenchmark for (2996ds/34Mi)
% 0.47/0.67 % (21990)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 theBenchmark for (2996ds/51Mi)
% 0.47/0.67 % (21996)Refutation found. Thanks to Tanya!
% 0.47/0.67 % SZS status Unsatisfiable for theBenchmark
% 0.47/0.67 % SZS output start Proof for theBenchmark
% See solution above
% 0.47/0.67 % (21996)------------------------------
% 0.47/0.67 % (21996)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.47/0.67 % (21996)Termination reason: Refutation
% 0.47/0.67
% 0.47/0.67 % (21996)Memory used [KB]: 960
% 0.47/0.67 % (21996)Time elapsed: 0.002 s
% 0.47/0.67 % (21996)Instructions burned: 3 (million)
% 0.47/0.67 % (21987)Success in time 0.329 s
% 0.47/0.67 % Vampire---4.8 exiting
%------------------------------------------------------------------------------