TSTP Solution File: SYN352+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYN352+1 : TPTP v8.1.2. Released v2.0.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 : n005.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:34:06 EDT 2024
% Result : Theorem 0.59s 0.77s
% Output : Refutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 3 unt; 0 def)
% Number of atoms : 162 ( 0 equ)
% Maximal formula atoms : 30 ( 10 avg)
% Number of connectives : 199 ( 53 ~; 72 |; 52 &)
% ( 4 <=>; 14 =>; 0 <=; 4 <~>)
% Maximal formula depth : 13 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 53 ( 32 !; 21 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f25,plain,
$false,
inference(resolution,[],[f20,f19]) ).
fof(f19,plain,
! [X0] : ~ big_f(X0,X0),
inference(subsumption_resolution,[],[f18,f16]) ).
fof(f16,plain,
! [X2,X3] :
( ~ big_f(X3,sK2(X2,X3))
| ~ big_f(X2,sK2(X2,X3))
| ~ big_f(X2,X3) ),
inference(cnf_transformation,[],[f9]) ).
fof(f9,plain,
! [X2,X3] :
( ( ( ( ~ big_f(X3,sK2(X2,X3))
| ~ big_f(X2,sK2(X2,X3)) )
& ( big_f(X3,sK2(X2,X3))
| big_f(X2,sK2(X2,X3)) ) )
| ~ big_f(X2,X3) )
& ( big_f(sK2(X2,X3),sK2(X2,X3))
| ( ( ~ big_f(X2,sK2(X2,X3))
| ~ big_f(sK1,sK2(X2,X3)) )
& ( big_f(X2,sK2(X2,X3))
| big_f(sK1,sK2(X2,X3)) )
& big_f(X2,X3) ) )
& ( big_f(X3,sK2(X2,X3))
| big_f(sK1,sK2(X2,X3))
| ~ big_f(X2,X3) )
& big_f(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f6,f8,f7]) ).
fof(f7,plain,
( ? [X0,X1] :
! [X2,X3] :
? [X4] :
( ( ( ( ~ big_f(X3,X4)
| ~ big_f(X2,X4) )
& ( big_f(X3,X4)
| big_f(X2,X4) ) )
| ~ big_f(X2,X3) )
& ( big_f(X4,X4)
| ( ( ~ big_f(X2,X4)
| ~ big_f(X1,X4) )
& ( big_f(X2,X4)
| big_f(X1,X4) )
& big_f(X2,X3) ) )
& ( big_f(X3,X4)
| big_f(X1,X4)
| ~ big_f(X2,X3) )
& big_f(X0,X1) )
=> ! [X3,X2] :
? [X4] :
( ( ( ( ~ big_f(X3,X4)
| ~ big_f(X2,X4) )
& ( big_f(X3,X4)
| big_f(X2,X4) ) )
| ~ big_f(X2,X3) )
& ( big_f(X4,X4)
| ( ( ~ big_f(X2,X4)
| ~ big_f(sK1,X4) )
& ( big_f(X2,X4)
| big_f(sK1,X4) )
& big_f(X2,X3) ) )
& ( big_f(X3,X4)
| big_f(sK1,X4)
| ~ big_f(X2,X3) )
& big_f(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
! [X2,X3] :
( ? [X4] :
( ( ( ( ~ big_f(X3,X4)
| ~ big_f(X2,X4) )
& ( big_f(X3,X4)
| big_f(X2,X4) ) )
| ~ big_f(X2,X3) )
& ( big_f(X4,X4)
| ( ( ~ big_f(X2,X4)
| ~ big_f(sK1,X4) )
& ( big_f(X2,X4)
| big_f(sK1,X4) )
& big_f(X2,X3) ) )
& ( big_f(X3,X4)
| big_f(sK1,X4)
| ~ big_f(X2,X3) )
& big_f(sK0,sK1) )
=> ( ( ( ( ~ big_f(X3,sK2(X2,X3))
| ~ big_f(X2,sK2(X2,X3)) )
& ( big_f(X3,sK2(X2,X3))
| big_f(X2,sK2(X2,X3)) ) )
| ~ big_f(X2,X3) )
& ( big_f(sK2(X2,X3),sK2(X2,X3))
| ( ( ~ big_f(X2,sK2(X2,X3))
| ~ big_f(sK1,sK2(X2,X3)) )
& ( big_f(X2,sK2(X2,X3))
| big_f(sK1,sK2(X2,X3)) )
& big_f(X2,X3) ) )
& ( big_f(X3,sK2(X2,X3))
| big_f(sK1,sK2(X2,X3))
| ~ big_f(X2,X3) )
& big_f(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
? [X0,X1] :
! [X2,X3] :
? [X4] :
( ( ( ( ~ big_f(X3,X4)
| ~ big_f(X2,X4) )
& ( big_f(X3,X4)
| big_f(X2,X4) ) )
| ~ big_f(X2,X3) )
& ( big_f(X4,X4)
| ( ( ~ big_f(X2,X4)
| ~ big_f(X1,X4) )
& ( big_f(X2,X4)
| big_f(X1,X4) )
& big_f(X2,X3) ) )
& ( big_f(X3,X4)
| big_f(X1,X4)
| ~ big_f(X2,X3) )
& big_f(X0,X1) ),
inference(flattening,[],[f5]) ).
fof(f5,plain,
? [X0,X1] :
! [X2,X3] :
? [X4] :
( ( ( ( ~ big_f(X3,X4)
| ~ big_f(X2,X4) )
& ( big_f(X3,X4)
| big_f(X2,X4) ) )
| ~ big_f(X2,X3) )
& ( big_f(X4,X4)
| ( ( ~ big_f(X2,X4)
| ~ big_f(X1,X4) )
& ( big_f(X2,X4)
| big_f(X1,X4) )
& big_f(X2,X3) ) )
& ( big_f(X3,X4)
| big_f(X1,X4)
| ~ big_f(X2,X3) )
& big_f(X0,X1) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,plain,
? [X0,X1] :
! [X2,X3] :
? [X4] :
( ( ( big_f(X2,X4)
<~> big_f(X3,X4) )
| ~ big_f(X2,X3) )
& ( big_f(X4,X4)
| ( ( big_f(X1,X4)
<~> big_f(X2,X4) )
& big_f(X2,X3) ) )
& ( big_f(X3,X4)
| big_f(X1,X4)
| ~ big_f(X2,X3) )
& big_f(X0,X1) ),
inference(flattening,[],[f3]) ).
fof(f3,plain,
? [X0,X1] :
! [X2,X3] :
? [X4] :
( ( ( big_f(X2,X4)
<~> big_f(X3,X4) )
| ~ big_f(X2,X3) )
& ( big_f(X4,X4)
| ( ( big_f(X1,X4)
<~> big_f(X2,X4) )
& big_f(X2,X3) ) )
& ( big_f(X3,X4)
| big_f(X1,X4)
| ~ big_f(X2,X3) )
& big_f(X0,X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,negated_conjecture,
~ ! [X0,X1] :
? [X2,X3] :
! [X4] :
( big_f(X0,X1)
=> ( ( big_f(X2,X3)
=> ( big_f(X3,X4)
| big_f(X1,X4) ) )
=> ( ( ( big_f(X2,X3)
=> ( big_f(X1,X4)
<=> big_f(X2,X4) ) )
=> big_f(X4,X4) )
=> ( ( big_f(X2,X4)
<=> big_f(X3,X4) )
& big_f(X2,X3) ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
! [X0,X1] :
? [X2,X3] :
! [X4] :
( big_f(X0,X1)
=> ( ( big_f(X2,X3)
=> ( big_f(X3,X4)
| big_f(X1,X4) ) )
=> ( ( ( big_f(X2,X3)
=> ( big_f(X1,X4)
<=> big_f(X2,X4) ) )
=> big_f(X4,X4) )
=> ( ( big_f(X2,X4)
<=> big_f(X3,X4) )
& big_f(X2,X3) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.4Iv2OOaMvK/Vampire---4.8_19370',church_46_18_4) ).
fof(f18,plain,
! [X0] :
( big_f(X0,sK2(X0,X0))
| ~ big_f(X0,X0) ),
inference(factoring,[],[f15]) ).
fof(f15,plain,
! [X2,X3] :
( big_f(X3,sK2(X2,X3))
| big_f(X2,sK2(X2,X3))
| ~ big_f(X2,X3) ),
inference(cnf_transformation,[],[f9]) ).
fof(f20,plain,
! [X0,X1] : big_f(X0,X1),
inference(resolution,[],[f19,f12]) ).
fof(f12,plain,
! [X2,X3] :
( big_f(sK2(X2,X3),sK2(X2,X3))
| big_f(X2,X3) ),
inference(cnf_transformation,[],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SYN352+1 : TPTP v8.1.2. Released v2.0.0.
% 0.08/0.16 % 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.16/0.37 % Computer : n005.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Tue Apr 30 17:19:56 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.16/0.37 This is a FOF_THM_RFO_NEQ problem
% 0.16/0.38 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.4Iv2OOaMvK/Vampire---4.8_19370
% 0.54/0.76 % (19622)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.54/0.76 % (19616)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.54/0.76 % (19618)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.54/0.76 % (19617)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.54/0.76 % (19621)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.54/0.76 % (19619)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.54/0.76 % (19623)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.54/0.76 % (19620)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.54/0.76 % (19618)First to succeed.
% 0.54/0.76 % (19621)Also succeeded, but the first one will report.
% 0.54/0.77 % (19623)Also succeeded, but the first one will report.
% 0.59/0.77 % (19618)Refutation found. Thanks to Tanya!
% 0.59/0.77 % SZS status Theorem for Vampire---4
% 0.59/0.77 % SZS output start Proof for Vampire---4
% See solution above
% 0.59/0.77 % (19618)------------------------------
% 0.59/0.77 % (19618)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.59/0.77 % (19618)Termination reason: Refutation
% 0.59/0.77
% 0.59/0.77 % (19618)Memory used [KB]: 972
% 0.59/0.77 % (19618)Time elapsed: 0.003 s
% 0.59/0.77 % (19618)Instructions burned: 3 (million)
% 0.59/0.77 % (19618)------------------------------
% 0.59/0.77 % (19618)------------------------------
% 0.59/0.77 % (19612)Success in time 0.383 s
% 0.59/0.77 % Vampire---4.8 exiting
%------------------------------------------------------------------------------