TSTP Solution File: SYN332+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SYN332+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n010.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 Apr 30 18:02:53 EDT 2024
% Result : Theorem 0.13s 0.36s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 2
% Syntax : Number of formulae : 30 ( 3 unt; 0 def)
% Number of atoms : 253 ( 0 equ)
% Maximal formula atoms : 60 ( 8 avg)
% Number of connectives : 327 ( 104 ~; 111 |; 77 &)
% ( 18 <=>; 11 =>; 0 <=; 6 <~>)
% Maximal formula depth : 17 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 2-2 aty)
% Number of variables : 56 ( 47 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f122,plain,
$false,
inference(resolution,[],[f119,f50]) ).
fof(f50,plain,
! [X0] : big_f(X0,X0),
inference(duplicate_literal_removal,[],[f48]) ).
fof(f48,plain,
! [X0] :
( big_f(X0,X0)
| big_f(X0,X0) ),
inference(resolution,[],[f44,f9]) ).
fof(f9,plain,
! [X0,X1] :
( big_f(X0,sK0(X0,X1))
| big_f(X0,X1) ),
inference(cnf_transformation,[],[f8]) ).
fof(f8,plain,
! [X0,X1] :
( ( ~ big_f(sK0(X0,X1),X1)
| ( ( ~ big_f(X1,X0)
| ~ big_f(X0,X1) )
& ( big_f(X1,X0)
| big_f(X0,X1) ) ) )
& ( big_f(sK0(X0,X1),X1)
| ( ( big_f(X0,X1)
| ~ big_f(X1,X0) )
& ( big_f(X1,X0)
| ~ big_f(X0,X1) ) ) )
& ( big_f(X0,X1)
| ~ big_f(X1,X0)
| ~ big_f(sK0(X0,X1),sK0(X0,X1)) )
& ( big_f(sK0(X0,X1),sK0(X0,X1))
| ( ~ big_f(X0,X1)
& big_f(X1,X0) ) )
& ( big_f(X0,sK0(X0,X1))
| ~ big_f(X1,sK0(X0,X1)) )
& ( big_f(X1,sK0(X0,X1))
| ~ big_f(X0,sK0(X0,X1)) )
& ( big_f(X0,sK0(X0,X1))
| ~ big_f(sK0(X0,X1),X0) )
& ( big_f(sK0(X0,X1),X0)
| ~ big_f(X0,sK0(X0,X1)) )
& ( ~ big_f(X0,sK0(X0,X1))
| ~ big_f(X1,X0)
| ~ big_f(X0,X1) )
& ( big_f(X0,sK0(X0,X1))
| ( big_f(X1,X0)
& big_f(X0,X1) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f6,f7]) ).
fof(f7,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ big_f(X2,X1)
| ( ( ~ big_f(X1,X0)
| ~ big_f(X0,X1) )
& ( big_f(X1,X0)
| big_f(X0,X1) ) ) )
& ( big_f(X2,X1)
| ( ( big_f(X0,X1)
| ~ big_f(X1,X0) )
& ( big_f(X1,X0)
| ~ big_f(X0,X1) ) ) )
& ( big_f(X0,X1)
| ~ big_f(X1,X0)
| ~ big_f(X2,X2) )
& ( big_f(X2,X2)
| ( ~ big_f(X0,X1)
& big_f(X1,X0) ) )
& ( big_f(X0,X2)
| ~ big_f(X1,X2) )
& ( big_f(X1,X2)
| ~ big_f(X0,X2) )
& ( big_f(X0,X2)
| ~ big_f(X2,X0) )
& ( big_f(X2,X0)
| ~ big_f(X0,X2) )
& ( ~ big_f(X0,X2)
| ~ big_f(X1,X0)
| ~ big_f(X0,X1) )
& ( big_f(X0,X2)
| ( big_f(X1,X0)
& big_f(X0,X1) ) ) )
=> ( ( ~ big_f(sK0(X0,X1),X1)
| ( ( ~ big_f(X1,X0)
| ~ big_f(X0,X1) )
& ( big_f(X1,X0)
| big_f(X0,X1) ) ) )
& ( big_f(sK0(X0,X1),X1)
| ( ( big_f(X0,X1)
| ~ big_f(X1,X0) )
& ( big_f(X1,X0)
| ~ big_f(X0,X1) ) ) )
& ( big_f(X0,X1)
| ~ big_f(X1,X0)
| ~ big_f(sK0(X0,X1),sK0(X0,X1)) )
& ( big_f(sK0(X0,X1),sK0(X0,X1))
| ( ~ big_f(X0,X1)
& big_f(X1,X0) ) )
& ( big_f(X0,sK0(X0,X1))
| ~ big_f(X1,sK0(X0,X1)) )
& ( big_f(X1,sK0(X0,X1))
| ~ big_f(X0,sK0(X0,X1)) )
& ( big_f(X0,sK0(X0,X1))
| ~ big_f(sK0(X0,X1),X0) )
& ( big_f(sK0(X0,X1),X0)
| ~ big_f(X0,sK0(X0,X1)) )
& ( ~ big_f(X0,sK0(X0,X1))
| ~ big_f(X1,X0)
| ~ big_f(X0,X1) )
& ( big_f(X0,sK0(X0,X1))
| ( big_f(X1,X0)
& big_f(X0,X1) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
! [X0,X1] :
? [X2] :
( ( ~ big_f(X2,X1)
| ( ( ~ big_f(X1,X0)
| ~ big_f(X0,X1) )
& ( big_f(X1,X0)
| big_f(X0,X1) ) ) )
& ( big_f(X2,X1)
| ( ( big_f(X0,X1)
| ~ big_f(X1,X0) )
& ( big_f(X1,X0)
| ~ big_f(X0,X1) ) ) )
& ( big_f(X0,X1)
| ~ big_f(X1,X0)
| ~ big_f(X2,X2) )
& ( big_f(X2,X2)
| ( ~ big_f(X0,X1)
& big_f(X1,X0) ) )
& ( big_f(X0,X2)
| ~ big_f(X1,X2) )
& ( big_f(X1,X2)
| ~ big_f(X0,X2) )
& ( big_f(X0,X2)
| ~ big_f(X2,X0) )
& ( big_f(X2,X0)
| ~ big_f(X0,X2) )
& ( ~ big_f(X0,X2)
| ~ big_f(X1,X0)
| ~ big_f(X0,X1) )
& ( big_f(X0,X2)
| ( big_f(X1,X0)
& big_f(X0,X1) ) ) ),
inference(flattening,[],[f5]) ).
fof(f5,plain,
! [X0,X1] :
? [X2] :
( ( ~ big_f(X2,X1)
| ( ( ~ big_f(X1,X0)
| ~ big_f(X0,X1) )
& ( big_f(X1,X0)
| big_f(X0,X1) ) ) )
& ( big_f(X2,X1)
| ( ( big_f(X0,X1)
| ~ big_f(X1,X0) )
& ( big_f(X1,X0)
| ~ big_f(X0,X1) ) ) )
& ( big_f(X0,X1)
| ~ big_f(X1,X0)
| ~ big_f(X2,X2) )
& ( big_f(X2,X2)
| ( ~ big_f(X0,X1)
& big_f(X1,X0) ) )
& ( big_f(X0,X2)
| ~ big_f(X1,X2) )
& ( big_f(X1,X2)
| ~ big_f(X0,X2) )
& ( big_f(X0,X2)
| ~ big_f(X2,X0) )
& ( big_f(X2,X0)
| ~ big_f(X0,X2) )
& ( ~ big_f(X0,X2)
| ~ big_f(X1,X0)
| ~ big_f(X0,X1) )
& ( big_f(X0,X2)
| ( big_f(X1,X0)
& big_f(X0,X1) ) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,plain,
! [X0,X1] :
? [X2] :
( ( ( big_f(X0,X1)
<=> big_f(X1,X0) )
<~> big_f(X2,X1) )
& ( ( big_f(X0,X1)
| ~ big_f(X1,X0) )
<=> big_f(X2,X2) )
& ( big_f(X0,X2)
<=> big_f(X1,X2) )
& ( big_f(X0,X2)
<=> big_f(X2,X0) )
& ( ( big_f(X1,X0)
& big_f(X0,X1) )
<~> big_f(X0,X2) ) ),
inference(flattening,[],[f3]) ).
fof(f3,plain,
! [X0,X1] :
? [X2] :
( ( ( big_f(X0,X1)
<=> big_f(X1,X0) )
<~> big_f(X2,X1) )
& ( ( big_f(X0,X1)
| ~ big_f(X1,X0) )
<=> big_f(X2,X2) )
& ( big_f(X0,X2)
<=> big_f(X1,X2) )
& ( big_f(X0,X2)
<=> big_f(X2,X0) )
& ( ( big_f(X1,X0)
& big_f(X0,X1) )
<~> big_f(X0,X2) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,negated_conjecture,
~ ? [X0,X1] :
! [X2] :
( ( ( big_f(X1,X0)
& big_f(X0,X1) )
<~> big_f(X0,X2) )
=> ( ( big_f(X0,X2)
<=> big_f(X2,X0) )
=> ( ( big_f(X0,X2)
<=> big_f(X1,X2) )
=> ( ( ( big_f(X1,X0)
=> big_f(X0,X1) )
<=> big_f(X2,X2) )
=> ( ( big_f(X0,X1)
<=> big_f(X1,X0) )
<=> big_f(X2,X1) ) ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
? [X0,X1] :
! [X2] :
( ( ( big_f(X1,X0)
& big_f(X0,X1) )
<~> big_f(X0,X2) )
=> ( ( big_f(X0,X2)
<=> big_f(X2,X0) )
=> ( ( big_f(X0,X2)
<=> big_f(X1,X2) )
=> ( ( ( big_f(X1,X0)
=> big_f(X0,X1) )
<=> big_f(X2,X2) )
=> ( ( big_f(X0,X1)
<=> big_f(X1,X0) )
<=> big_f(X2,X1) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',church_46_14_4) ).
fof(f44,plain,
! [X0] :
( ~ big_f(X0,sK0(X0,X0))
| big_f(X0,X0) ),
inference(duplicate_literal_removal,[],[f39]) ).
fof(f39,plain,
! [X0] :
( big_f(X0,X0)
| big_f(X0,X0)
| ~ big_f(X0,sK0(X0,X0)) ),
inference(resolution,[],[f21,f12]) ).
fof(f12,plain,
! [X0,X1] :
( big_f(sK0(X0,X1),X0)
| ~ big_f(X0,sK0(X0,X1)) ),
inference(cnf_transformation,[],[f8]) ).
fof(f21,plain,
! [X0,X1] :
( ~ big_f(sK0(X0,X1),X1)
| big_f(X1,X0)
| big_f(X0,X1) ),
inference(cnf_transformation,[],[f8]) ).
fof(f119,plain,
! [X0] : ~ big_f(X0,X0),
inference(duplicate_literal_removal,[],[f116]) ).
fof(f116,plain,
! [X0] :
( ~ big_f(X0,X0)
| ~ big_f(X0,X0)
| ~ big_f(X0,X0) ),
inference(resolution,[],[f106,f22]) ).
fof(f22,plain,
! [X0,X1] :
( ~ big_f(sK0(X0,X1),X1)
| ~ big_f(X1,X0)
| ~ big_f(X0,X1) ),
inference(cnf_transformation,[],[f8]) ).
fof(f106,plain,
! [X0] :
( big_f(sK0(X0,X0),X0)
| ~ big_f(X0,X0) ),
inference(resolution,[],[f101,f28]) ).
fof(f28,plain,
! [X0] :
( ~ big_f(X0,sK0(X0,X0))
| ~ big_f(X0,X0) ),
inference(duplicate_literal_removal,[],[f27]) ).
fof(f27,plain,
! [X0] :
( ~ big_f(X0,X0)
| ~ big_f(X0,X0)
| ~ big_f(X0,sK0(X0,X0)) ),
inference(resolution,[],[f11,f14]) ).
fof(f14,plain,
! [X0,X1] :
( big_f(X1,sK0(X0,X1))
| ~ big_f(X0,sK0(X0,X1)) ),
inference(cnf_transformation,[],[f8]) ).
fof(f11,plain,
! [X0,X1] :
( ~ big_f(X0,sK0(X0,X1))
| ~ big_f(X1,X0)
| ~ big_f(X0,X1) ),
inference(cnf_transformation,[],[f8]) ).
fof(f101,plain,
! [X0,X1] :
( big_f(X1,X0)
| big_f(X0,X1) ),
inference(duplicate_literal_removal,[],[f97]) ).
fof(f97,plain,
! [X0,X1] :
( big_f(X0,X1)
| big_f(X1,X0)
| big_f(X0,X1) ),
inference(resolution,[],[f88,f9]) ).
fof(f88,plain,
! [X0,X1] :
( ~ big_f(X1,sK0(X1,X0))
| big_f(X1,X0)
| big_f(X0,X1) ),
inference(resolution,[],[f67,f14]) ).
fof(f67,plain,
! [X0,X1] :
( ~ big_f(X0,sK0(X1,X0))
| big_f(X0,X1)
| big_f(X1,X0) ),
inference(resolution,[],[f60,f21]) ).
fof(f60,plain,
! [X0,X1] :
( big_f(X1,X0)
| ~ big_f(X0,X1) ),
inference(resolution,[],[f18,f50]) ).
fof(f18,plain,
! [X0,X1] :
( ~ big_f(sK0(X0,X1),sK0(X0,X1))
| ~ big_f(X1,X0)
| big_f(X0,X1) ),
inference(cnf_transformation,[],[f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SYN332+1 : TPTP v8.1.2. Released v2.0.0.
% 0.04/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.34 % Computer : n010.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Apr 30 01:42:20 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 % (27671)Running in auto input_syntax mode. Trying TPTP
% 0.13/0.36 % (27676)dis-2_2:3_amm=sco:anc=none:bce=on:fsr=off:gsp=on:nm=16:nwc=1.2:nicw=on:sac=on:sp=weighted_frequency_476 on theBenchmark for (476ds/0Mi)
% 0.13/0.36 % (27676)First to succeed.
% 0.13/0.36 % (27676)Refutation found. Thanks to Tanya!
% 0.13/0.36 % SZS status Theorem for theBenchmark
% 0.13/0.36 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.36 % (27676)------------------------------
% 0.13/0.36 % (27676)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.13/0.36 % (27676)Termination reason: Refutation
% 0.13/0.36
% 0.13/0.36 % (27676)Memory used [KB]: 754
% 0.13/0.36 % (27676)Time elapsed: 0.003 s
% 0.13/0.36 % (27676)Instructions burned: 6 (million)
% 0.13/0.36 % (27676)------------------------------
% 0.13/0.36 % (27676)------------------------------
% 0.13/0.36 % (27671)Success in time 0.011 s
%------------------------------------------------------------------------------