TSTP Solution File: SYN349+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SYN349+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n018.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 Aug 31 19:37:38 EDT 2022
% Result : Theorem 0.16s 0.48s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 3
% Syntax : Number of formulae : 34 ( 5 unt; 0 def)
% Number of atoms : 269 ( 0 equ)
% Maximal formula atoms : 52 ( 7 avg)
% Number of connectives : 358 ( 123 ~; 155 |; 64 &)
% ( 11 <=>; 4 =>; 0 <=; 1 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-2 aty)
% Number of variables : 68 ( 54 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f65,plain,
$false,
inference(subsumption_resolution,[],[f64,f51]) ).
fof(f51,plain,
! [X0] : big_f(sK0(X0),sK1(X0,sK0(X0))),
inference(subsumption_resolution,[],[f50,f40]) ).
fof(f40,plain,
! [X0] :
( big_f(sK1(X0,sK0(X0)),sK0(X0))
| big_f(sK0(X0),sK1(X0,sK0(X0))) ),
inference(subsumption_resolution,[],[f35,f27]) ).
fof(f27,plain,
! [X2,X0] :
( ~ big_f(X0,sK1(X0,X2))
| big_f(sK0(X0),sK1(X0,X2)) ),
inference(literal_reordering,[],[f9]) ).
fof(f9,plain,
! [X2,X0] :
( ~ big_f(X0,sK1(X0,X2))
| big_f(sK0(X0),sK1(X0,X2)) ),
inference(cnf_transformation,[],[f8]) ).
fof(f8,plain,
! [X0,X2] :
( ( ( ( ( ( ~ big_f(X0,sK1(X0,X2))
| ~ big_f(sK1(X0,X2),X2) )
& ( big_f(X0,sK1(X0,X2))
| big_f(sK1(X0,X2),X2) ) )
| ~ big_f(X2,sK1(X0,X2)) )
& ( ( ( big_f(sK1(X0,X2),X2)
| ~ big_f(X0,sK1(X0,X2)) )
& ( big_f(X0,sK1(X0,X2))
| ~ big_f(sK1(X0,X2),X2) ) )
| big_f(X2,sK1(X0,X2)) ) )
| ~ big_f(sK1(X0,X2),sK0(X0)) )
& ( ( ( big_f(X2,sK1(X0,X2))
| ( ( ~ big_f(X0,sK1(X0,X2))
| ~ big_f(sK1(X0,X2),X2) )
& ( big_f(X0,sK1(X0,X2))
| big_f(sK1(X0,X2),X2) ) ) )
& ( ( ( big_f(sK1(X0,X2),X2)
| ~ big_f(X0,sK1(X0,X2)) )
& ( big_f(X0,sK1(X0,X2))
| ~ big_f(sK1(X0,X2),X2) ) )
| ~ big_f(X2,sK1(X0,X2)) ) )
| big_f(sK1(X0,X2),sK0(X0)) )
& ( big_f(X0,sK1(X0,X2))
| ~ big_f(sK0(X0),sK1(X0,X2)) )
& ( big_f(sK0(X0),sK1(X0,X2))
| ~ big_f(X0,sK1(X0,X2)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f5,f7,f6]) ).
fof(f6,plain,
! [X0] :
( ? [X1] :
! [X2] :
? [X3] :
( ( ( ( ( ( ~ big_f(X0,X3)
| ~ big_f(X3,X2) )
& ( big_f(X0,X3)
| big_f(X3,X2) ) )
| ~ big_f(X2,X3) )
& ( ( ( big_f(X3,X2)
| ~ big_f(X0,X3) )
& ( big_f(X0,X3)
| ~ big_f(X3,X2) ) )
| big_f(X2,X3) ) )
| ~ big_f(X3,X1) )
& ( ( ( big_f(X2,X3)
| ( ( ~ big_f(X0,X3)
| ~ big_f(X3,X2) )
& ( big_f(X0,X3)
| big_f(X3,X2) ) ) )
& ( ( ( big_f(X3,X2)
| ~ big_f(X0,X3) )
& ( big_f(X0,X3)
| ~ big_f(X3,X2) ) )
| ~ big_f(X2,X3) ) )
| big_f(X3,X1) )
& ( big_f(X0,X3)
| ~ big_f(X1,X3) )
& ( big_f(X1,X3)
| ~ big_f(X0,X3) ) )
=> ! [X2] :
? [X3] :
( ( ( ( ( ( ~ big_f(X0,X3)
| ~ big_f(X3,X2) )
& ( big_f(X0,X3)
| big_f(X3,X2) ) )
| ~ big_f(X2,X3) )
& ( ( ( big_f(X3,X2)
| ~ big_f(X0,X3) )
& ( big_f(X0,X3)
| ~ big_f(X3,X2) ) )
| big_f(X2,X3) ) )
| ~ big_f(X3,sK0(X0)) )
& ( ( ( big_f(X2,X3)
| ( ( ~ big_f(X0,X3)
| ~ big_f(X3,X2) )
& ( big_f(X0,X3)
| big_f(X3,X2) ) ) )
& ( ( ( big_f(X3,X2)
| ~ big_f(X0,X3) )
& ( big_f(X0,X3)
| ~ big_f(X3,X2) ) )
| ~ big_f(X2,X3) ) )
| big_f(X3,sK0(X0)) )
& ( big_f(X0,X3)
| ~ big_f(sK0(X0),X3) )
& ( big_f(sK0(X0),X3)
| ~ big_f(X0,X3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f7,plain,
! [X0,X2] :
( ? [X3] :
( ( ( ( ( ( ~ big_f(X0,X3)
| ~ big_f(X3,X2) )
& ( big_f(X0,X3)
| big_f(X3,X2) ) )
| ~ big_f(X2,X3) )
& ( ( ( big_f(X3,X2)
| ~ big_f(X0,X3) )
& ( big_f(X0,X3)
| ~ big_f(X3,X2) ) )
| big_f(X2,X3) ) )
| ~ big_f(X3,sK0(X0)) )
& ( ( ( big_f(X2,X3)
| ( ( ~ big_f(X0,X3)
| ~ big_f(X3,X2) )
& ( big_f(X0,X3)
| big_f(X3,X2) ) ) )
& ( ( ( big_f(X3,X2)
| ~ big_f(X0,X3) )
& ( big_f(X0,X3)
| ~ big_f(X3,X2) ) )
| ~ big_f(X2,X3) ) )
| big_f(X3,sK0(X0)) )
& ( big_f(X0,X3)
| ~ big_f(sK0(X0),X3) )
& ( big_f(sK0(X0),X3)
| ~ big_f(X0,X3) ) )
=> ( ( ( ( ( ( ~ big_f(X0,sK1(X0,X2))
| ~ big_f(sK1(X0,X2),X2) )
& ( big_f(X0,sK1(X0,X2))
| big_f(sK1(X0,X2),X2) ) )
| ~ big_f(X2,sK1(X0,X2)) )
& ( ( ( big_f(sK1(X0,X2),X2)
| ~ big_f(X0,sK1(X0,X2)) )
& ( big_f(X0,sK1(X0,X2))
| ~ big_f(sK1(X0,X2),X2) ) )
| big_f(X2,sK1(X0,X2)) ) )
| ~ big_f(sK1(X0,X2),sK0(X0)) )
& ( ( ( big_f(X2,sK1(X0,X2))
| ( ( ~ big_f(X0,sK1(X0,X2))
| ~ big_f(sK1(X0,X2),X2) )
& ( big_f(X0,sK1(X0,X2))
| big_f(sK1(X0,X2),X2) ) ) )
& ( ( ( big_f(sK1(X0,X2),X2)
| ~ big_f(X0,sK1(X0,X2)) )
& ( big_f(X0,sK1(X0,X2))
| ~ big_f(sK1(X0,X2),X2) ) )
| ~ big_f(X2,sK1(X0,X2)) ) )
| big_f(sK1(X0,X2),sK0(X0)) )
& ( big_f(X0,sK1(X0,X2))
| ~ big_f(sK0(X0),sK1(X0,X2)) )
& ( big_f(sK0(X0),sK1(X0,X2))
| ~ big_f(X0,sK1(X0,X2)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f5,plain,
! [X0] :
? [X1] :
! [X2] :
? [X3] :
( ( ( ( ( ( ~ big_f(X0,X3)
| ~ big_f(X3,X2) )
& ( big_f(X0,X3)
| big_f(X3,X2) ) )
| ~ big_f(X2,X3) )
& ( ( ( big_f(X3,X2)
| ~ big_f(X0,X3) )
& ( big_f(X0,X3)
| ~ big_f(X3,X2) ) )
| big_f(X2,X3) ) )
| ~ big_f(X3,X1) )
& ( ( ( big_f(X2,X3)
| ( ( ~ big_f(X0,X3)
| ~ big_f(X3,X2) )
& ( big_f(X0,X3)
| big_f(X3,X2) ) ) )
& ( ( ( big_f(X3,X2)
| ~ big_f(X0,X3) )
& ( big_f(X0,X3)
| ~ big_f(X3,X2) ) )
| ~ big_f(X2,X3) ) )
| big_f(X3,X1) )
& ( big_f(X0,X3)
| ~ big_f(X1,X3) )
& ( big_f(X1,X3)
| ~ big_f(X0,X3) ) ),
inference(flattening,[],[f4]) ).
fof(f4,plain,
! [X0] :
? [X1] :
! [X2] :
? [X3] :
( ( ( ( ( ( ~ big_f(X0,X3)
| ~ big_f(X3,X2) )
& ( big_f(X0,X3)
| big_f(X3,X2) ) )
| ~ big_f(X2,X3) )
& ( ( ( big_f(X3,X2)
| ~ big_f(X0,X3) )
& ( big_f(X0,X3)
| ~ big_f(X3,X2) ) )
| big_f(X2,X3) ) )
| ~ big_f(X3,X1) )
& ( ( ( big_f(X2,X3)
| ( ( ~ big_f(X0,X3)
| ~ big_f(X3,X2) )
& ( big_f(X0,X3)
| big_f(X3,X2) ) ) )
& ( ( ( big_f(X3,X2)
| ~ big_f(X0,X3) )
& ( big_f(X0,X3)
| ~ big_f(X3,X2) ) )
| ~ big_f(X2,X3) ) )
| big_f(X3,X1) )
& ( big_f(X0,X3)
| ~ big_f(X1,X3) )
& ( big_f(X1,X3)
| ~ big_f(X0,X3) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f3,plain,
! [X0] :
? [X1] :
! [X2] :
? [X3] :
( ( big_f(X3,X1)
<~> ( big_f(X2,X3)
<=> ( big_f(X3,X2)
<=> big_f(X0,X3) ) ) )
& ( big_f(X0,X3)
<=> big_f(X1,X3) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,negated_conjecture,
~ ? [X0] :
! [X1] :
? [X2] :
! [X3] :
( ( big_f(X0,X3)
<=> big_f(X1,X3) )
=> ( big_f(X3,X1)
<=> ( big_f(X2,X3)
<=> ( big_f(X3,X2)
<=> big_f(X0,X3) ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
? [X0] :
! [X1] :
? [X2] :
! [X3] :
( ( big_f(X0,X3)
<=> big_f(X1,X3) )
=> ( big_f(X3,X1)
<=> ( big_f(X2,X3)
<=> ( big_f(X3,X2)
<=> big_f(X0,X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_17_5) ).
fof(f35,plain,
! [X0] :
( big_f(sK1(X0,sK0(X0)),sK0(X0))
| big_f(sK0(X0),sK1(X0,sK0(X0)))
| big_f(X0,sK1(X0,sK0(X0))) ),
inference(factoring,[],[f23]) ).
fof(f23,plain,
! [X2,X0] :
( big_f(sK1(X0,X2),X2)
| big_f(sK1(X0,X2),sK0(X0))
| big_f(X2,sK1(X0,X2))
| big_f(X0,sK1(X0,X2)) ),
inference(literal_reordering,[],[f13]) ).
fof(f13,plain,
! [X2,X0] :
( big_f(sK1(X0,X2),sK0(X0))
| big_f(X2,sK1(X0,X2))
| big_f(X0,sK1(X0,X2))
| big_f(sK1(X0,X2),X2) ),
inference(cnf_transformation,[],[f8]) ).
fof(f50,plain,
! [X0] :
( big_f(sK0(X0),sK1(X0,sK0(X0)))
| ~ big_f(sK1(X0,sK0(X0)),sK0(X0)) ),
inference(subsumption_resolution,[],[f49,f27]) ).
fof(f49,plain,
! [X0] :
( big_f(X0,sK1(X0,sK0(X0)))
| ~ big_f(sK1(X0,sK0(X0)),sK0(X0))
| big_f(sK0(X0),sK1(X0,sK0(X0))) ),
inference(duplicate_literal_removal,[],[f45]) ).
fof(f45,plain,
! [X0] :
( big_f(X0,sK1(X0,sK0(X0)))
| big_f(sK0(X0),sK1(X0,sK0(X0)))
| ~ big_f(sK1(X0,sK0(X0)),sK0(X0))
| big_f(sK0(X0),sK1(X0,sK0(X0))) ),
inference(resolution,[],[f40,f26]) ).
fof(f26,plain,
! [X2,X0] :
( ~ big_f(sK1(X0,X2),sK0(X0))
| big_f(X0,sK1(X0,X2))
| ~ big_f(sK1(X0,X2),X2)
| big_f(X2,sK1(X0,X2)) ),
inference(literal_reordering,[],[f15]) ).
fof(f15,plain,
! [X2,X0] :
( big_f(X0,sK1(X0,X2))
| ~ big_f(sK1(X0,X2),sK0(X0))
| ~ big_f(sK1(X0,X2),X2)
| big_f(X2,sK1(X0,X2)) ),
inference(cnf_transformation,[],[f8]) ).
fof(f64,plain,
! [X2] : ~ big_f(sK0(X2),sK1(X2,sK0(X2))),
inference(subsumption_resolution,[],[f63,f58]) ).
fof(f58,plain,
! [X1] : big_f(sK1(X1,sK0(X1)),sK0(X1)),
inference(subsumption_resolution,[],[f54,f52]) ).
fof(f52,plain,
! [X0] : big_f(X0,sK1(X0,sK0(X0))),
inference(resolution,[],[f51,f24]) ).
fof(f24,plain,
! [X2,X0] :
( ~ big_f(sK0(X0),sK1(X0,X2))
| big_f(X0,sK1(X0,X2)) ),
inference(literal_reordering,[],[f10]) ).
fof(f10,plain,
! [X2,X0] :
( ~ big_f(sK0(X0),sK1(X0,X2))
| big_f(X0,sK1(X0,X2)) ),
inference(cnf_transformation,[],[f8]) ).
fof(f54,plain,
! [X1] :
( big_f(sK1(X1,sK0(X1)),sK0(X1))
| ~ big_f(X1,sK1(X1,sK0(X1))) ),
inference(duplicate_literal_removal,[],[f53]) ).
fof(f53,plain,
! [X1] :
( big_f(sK1(X1,sK0(X1)),sK0(X1))
| ~ big_f(X1,sK1(X1,sK0(X1)))
| big_f(sK1(X1,sK0(X1)),sK0(X1)) ),
inference(resolution,[],[f51,f20]) ).
fof(f20,plain,
! [X2,X0] :
( ~ big_f(X2,sK1(X0,X2))
| big_f(sK1(X0,X2),sK0(X0))
| big_f(sK1(X0,X2),X2)
| ~ big_f(X0,sK1(X0,X2)) ),
inference(literal_reordering,[],[f12]) ).
fof(f12,plain,
! [X2,X0] :
( ~ big_f(X2,sK1(X0,X2))
| big_f(sK1(X0,X2),sK0(X0))
| ~ big_f(X0,sK1(X0,X2))
| big_f(sK1(X0,X2),X2) ),
inference(cnf_transformation,[],[f8]) ).
fof(f63,plain,
! [X2] :
( ~ big_f(sK1(X2,sK0(X2)),sK0(X2))
| ~ big_f(sK0(X2),sK1(X2,sK0(X2))) ),
inference(subsumption_resolution,[],[f61,f52]) ).
fof(f61,plain,
! [X2] :
( ~ big_f(X2,sK1(X2,sK0(X2)))
| ~ big_f(sK0(X2),sK1(X2,sK0(X2)))
| ~ big_f(sK1(X2,sK0(X2)),sK0(X2)) ),
inference(resolution,[],[f58,f19]) ).
fof(f19,plain,
! [X2,X0] :
( ~ big_f(sK1(X0,X2),sK0(X0))
| ~ big_f(X2,sK1(X0,X2))
| ~ big_f(sK1(X0,X2),X2)
| ~ big_f(X0,sK1(X0,X2)) ),
inference(literal_reordering,[],[f18]) ).
fof(f18,plain,
! [X2,X0] :
( ~ big_f(X2,sK1(X0,X2))
| ~ big_f(sK1(X0,X2),sK0(X0))
| ~ big_f(sK1(X0,X2),X2)
| ~ big_f(X0,sK1(X0,X2)) ),
inference(cnf_transformation,[],[f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SYN349+1 : TPTP v8.1.0. Released v2.0.0.
% 0.02/0.11 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.10/0.31 % Computer : n018.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Aug 30 21:50:40 EDT 2022
% 0.10/0.31 % CPUTime :
% 0.16/0.45 % (6327)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.16/0.45 % (6327)Instruction limit reached!
% 0.16/0.45 % (6327)------------------------------
% 0.16/0.45 % (6327)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/0.45 % (6327)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/0.45 % (6327)Termination reason: Unknown
% 0.16/0.45 % (6327)Termination phase: Property scanning
% 0.16/0.45
% 0.16/0.45 % (6327)Memory used [KB]: 895
% 0.16/0.45 % (6327)Time elapsed: 0.003 s
% 0.16/0.45 % (6327)Instructions burned: 2 (million)
% 0.16/0.45 % (6327)------------------------------
% 0.16/0.45 % (6327)------------------------------
% 0.16/0.46 % (6325)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.16/0.46 % (6333)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/68Mi)
% 0.16/0.46 % (6343)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/482Mi)
% 0.16/0.47 % (6333)First to succeed.
% 0.16/0.47 % (6335)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/99Mi)
% 0.16/0.47 % (6341)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/498Mi)
% 0.16/0.47 TRYING [1]
% 0.16/0.47 % (6343)Also succeeded, but the first one will report.
% 0.16/0.48 % (6333)Refutation found. Thanks to Tanya!
% 0.16/0.48 % SZS status Theorem for theBenchmark
% 0.16/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.48 % (6333)------------------------------
% 0.16/0.48 % (6333)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/0.48 % (6333)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/0.48 % (6333)Termination reason: Refutation
% 0.16/0.48
% 0.16/0.48 % (6333)Memory used [KB]: 5756
% 0.16/0.48 % (6333)Time elapsed: 0.007 s
% 0.16/0.48 % (6333)Instructions burned: 4 (million)
% 0.16/0.48 % (6333)------------------------------
% 0.16/0.48 % (6333)------------------------------
% 0.16/0.48 % (6318)Success in time 0.158 s
%------------------------------------------------------------------------------