TSTP Solution File: SYN354+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYN354+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 : n031.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.53s 0.74s
% Output : Refutation 0.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 25 ( 3 unt; 0 def)
% Number of atoms : 93 ( 0 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 99 ( 31 ~; 34 |; 12 &)
% ( 8 <=>; 12 =>; 0 <=; 2 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 26 ( 16 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f79,plain,
$false,
inference(avatar_sat_refutation,[],[f32,f49,f78]) ).
fof(f78,plain,
( spl3_3
| ~ spl3_4 ),
inference(avatar_contradiction_clause,[],[f77]) ).
fof(f77,plain,
( $false
| spl3_3
| ~ spl3_4 ),
inference(subsumption_resolution,[],[f76,f26]) ).
fof(f26,plain,
( ~ big_f(sK1,sK1)
| spl3_3 ),
inference(avatar_component_clause,[],[f25]) ).
fof(f25,plain,
( spl3_3
<=> big_f(sK1,sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
fof(f76,plain,
( big_f(sK1,sK1)
| ~ spl3_4 ),
inference(subsumption_resolution,[],[f75,f10]) ).
fof(f10,plain,
big_f(sK0,sK1),
inference(cnf_transformation,[],[f4]) ).
fof(f4,plain,
? [X0,X1] :
! [X2,X3] :
? [X4] :
( ( ~ big_f(X2,X3)
| ~ big_f(X1,X2)
| ~ big_f(X0,X2) )
& ( big_g(X1,X4)
<=> big_g(X2,X4) )
& ( big_f(X1,X3)
| ~ big_f(X2,X3)
| ( big_g(X1,X4)
<~> big_g(X3,X4) ) )
& big_g(X0,X1)
& big_f(X0,X1) ),
inference(flattening,[],[f3]) ).
fof(f3,plain,
? [X0,X1] :
! [X2,X3] :
? [X4] :
( ( ~ big_f(X2,X3)
| ~ big_f(X1,X2)
| ~ big_f(X0,X2) )
& ( big_g(X1,X4)
<=> big_g(X2,X4) )
& ( big_f(X1,X3)
| ~ big_f(X2,X3)
| ( big_g(X1,X4)
<~> big_g(X3,X4) ) )
& big_g(X0,X1)
& big_f(X0,X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,negated_conjecture,
~ ! [X0,X1] :
? [X2,X3] :
! [X4] :
( big_f(X0,X1)
=> ( big_g(X0,X1)
=> ( ( ( big_g(X1,X4)
<=> big_g(X3,X4) )
=> ( big_f(X2,X3)
=> big_f(X1,X3) ) )
=> ( ( big_g(X1,X4)
<=> big_g(X2,X4) )
=> ( big_f(X2,X3)
& big_f(X1,X2)
& big_f(X0,X2) ) ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
! [X0,X1] :
? [X2,X3] :
! [X4] :
( big_f(X0,X1)
=> ( big_g(X0,X1)
=> ( ( ( big_g(X1,X4)
<=> big_g(X3,X4) )
=> ( big_f(X2,X3)
=> big_f(X1,X3) ) )
=> ( ( big_g(X1,X4)
<=> big_g(X2,X4) )
=> ( big_f(X2,X3)
& big_f(X1,X2)
& big_f(X0,X2) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.oclnSqsIAB/Vampire---4.8_6517',church_46_20_1) ).
fof(f75,plain,
( ~ big_f(sK0,sK1)
| big_f(sK1,sK1)
| ~ spl3_4 ),
inference(subsumption_resolution,[],[f59,f31]) ).
fof(f31,plain,
( big_g(sK1,sK2(sK0,sK1))
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f29]) ).
fof(f29,plain,
( spl3_4
<=> big_g(sK1,sK2(sK0,sK1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
fof(f59,plain,
( ~ big_g(sK1,sK2(sK0,sK1))
| ~ big_f(sK0,sK1)
| big_f(sK1,sK1)
| ~ spl3_4 ),
inference(resolution,[],[f31,f6]) ).
fof(f6,plain,
! [X2,X3] :
( ~ big_g(sK1,sK2(X2,X3))
| ~ big_g(X3,sK2(X2,X3))
| ~ big_f(X2,X3)
| big_f(sK1,X3) ),
inference(cnf_transformation,[],[f4]) ).
fof(f49,plain,
~ spl3_3,
inference(avatar_contradiction_clause,[],[f48]) ).
fof(f48,plain,
( $false
| ~ spl3_3 ),
inference(subsumption_resolution,[],[f33,f10]) ).
fof(f33,plain,
( ~ big_f(sK0,sK1)
| ~ spl3_3 ),
inference(unit_resulting_resolution,[],[f27,f27,f7]) ).
fof(f7,plain,
! [X2,X3] :
( ~ big_f(X2,X3)
| ~ big_f(sK1,X2)
| ~ big_f(sK0,X2) ),
inference(cnf_transformation,[],[f4]) ).
fof(f27,plain,
( big_f(sK1,sK1)
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f25]) ).
fof(f32,plain,
( spl3_3
| spl3_4 ),
inference(avatar_split_clause,[],[f23,f29,f25]) ).
fof(f23,plain,
( big_g(sK1,sK2(sK0,sK1))
| big_f(sK1,sK1) ),
inference(duplicate_literal_removal,[],[f22]) ).
fof(f22,plain,
( big_g(sK1,sK2(sK0,sK1))
| big_g(sK1,sK2(sK0,sK1))
| big_f(sK1,sK1) ),
inference(resolution,[],[f5,f10]) ).
fof(f5,plain,
! [X2,X3] :
( ~ big_f(X2,X3)
| big_g(sK1,sK2(X2,X3))
| big_g(X3,sK2(X2,X3))
| big_f(sK1,X3) ),
inference(cnf_transformation,[],[f4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN354+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.14 % 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.14/0.35 % Computer : n031.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Apr 30 18:01:59 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a FOF_THM_RFO_NEQ problem
% 0.14/0.36 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.oclnSqsIAB/Vampire---4.8_6517
% 0.53/0.74 % (6785)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.53/0.74 % (6779)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.53/0.74 % (6781)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.53/0.74 % (6782)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.53/0.74 % (6785)First to succeed.
% 0.53/0.74 % (6784)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.53/0.74 % (6786)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.53/0.74 % (6783)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.53/0.74 % (6784)Also succeeded, but the first one will report.
% 0.53/0.74 % (6785)Refutation found. Thanks to Tanya!
% 0.53/0.74 % SZS status Theorem for Vampire---4
% 0.53/0.74 % SZS output start Proof for Vampire---4
% See solution above
% 0.53/0.74 % (6785)------------------------------
% 0.53/0.74 % (6785)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.53/0.74 % (6785)Termination reason: Refutation
% 0.53/0.74
% 0.53/0.74 % (6785)Memory used [KB]: 991
% 0.53/0.74 % (6785)Time elapsed: 0.003 s
% 0.53/0.74 % (6785)Instructions burned: 3 (million)
% 0.53/0.74 % (6785)------------------------------
% 0.53/0.74 % (6785)------------------------------
% 0.53/0.74 % (6775)Success in time 0.375 s
% 0.53/0.74 % Vampire---4.8 exiting
%------------------------------------------------------------------------------