TSTP Solution File: LCL678+1.001 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : LCL678+1.001 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n013.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 17:45:01 EDT 2022
% Result : Theorem 0.19s 0.47s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 20 ( 4 unt; 0 def)
% Number of atoms : 92 ( 0 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 145 ( 73 ~; 49 |; 20 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 59 ( 42 !; 17 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f39,plain,
$false,
inference(unit_resulting_resolution,[],[f18,f33,f20]) ).
fof(f20,plain,
! [X1] :
( ~ r1(sK0,X1)
| r1(X1,sK1(X1)) ),
inference(cnf_transformation,[],[f16]) ).
fof(f16,plain,
! [X1] :
( ~ r1(sK0,X1)
| ( ~ p1(sK2(X1))
& r1(sK1(X1),sK2(X1))
& r1(X1,sK1(X1))
& ! [X4] :
( p1(X4)
| ~ r1(sK1(X1),X4) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f11,f15,f14,f13]) ).
fof(f13,plain,
( ? [X0] :
! [X1] :
( ~ r1(X0,X1)
| ? [X2] :
( ? [X3] :
( ~ p1(X3)
& r1(X2,X3) )
& r1(X1,X2)
& ! [X4] :
( p1(X4)
| ~ r1(X2,X4) ) ) )
=> ! [X1] :
( ~ r1(sK0,X1)
| ? [X2] :
( ? [X3] :
( ~ p1(X3)
& r1(X2,X3) )
& r1(X1,X2)
& ! [X4] :
( p1(X4)
| ~ r1(X2,X4) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f14,plain,
! [X1] :
( ? [X2] :
( ? [X3] :
( ~ p1(X3)
& r1(X2,X3) )
& r1(X1,X2)
& ! [X4] :
( p1(X4)
| ~ r1(X2,X4) ) )
=> ( ? [X3] :
( ~ p1(X3)
& r1(sK1(X1),X3) )
& r1(X1,sK1(X1))
& ! [X4] :
( p1(X4)
| ~ r1(sK1(X1),X4) ) ) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
! [X1] :
( ? [X3] :
( ~ p1(X3)
& r1(sK1(X1),X3) )
=> ( ~ p1(sK2(X1))
& r1(sK1(X1),sK2(X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f11,plain,
? [X0] :
! [X1] :
( ~ r1(X0,X1)
| ? [X2] :
( ? [X3] :
( ~ p1(X3)
& r1(X2,X3) )
& r1(X1,X2)
& ! [X4] :
( p1(X4)
| ~ r1(X2,X4) ) ) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,plain,
? [X0] :
! [X1] :
( ~ r1(X0,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| ! [X3] :
( p1(X3)
| ~ r1(X2,X3) )
| ~ ! [X4] :
( p1(X4)
| ~ r1(X2,X4) ) ) ),
inference(flattening,[],[f6]) ).
fof(f6,plain,
~ ~ ? [X0] :
~ ~ ! [X1] :
( ~ r1(X0,X1)
| ~ ! [X2] :
( ~ r1(X1,X2)
| ! [X3] :
( p1(X3)
| ~ r1(X2,X3) )
| ~ ! [X4] :
( p1(X4)
| ~ r1(X2,X4) ) ) ),
inference(true_and_false_elimination,[],[f5]) ).
fof(f5,plain,
~ ~ ? [X0] :
~ ( ~ ! [X1] :
( ~ ! [X2] :
( ~ r1(X1,X2)
| ! [X3] :
( p1(X3)
| ~ r1(X2,X3) )
| ~ ! [X4] :
( p1(X4)
| ~ r1(X2,X4) ) )
| $false
| ~ r1(X0,X1) )
| $false ),
inference(rectify,[],[f4]) ).
fof(f4,negated_conjecture,
~ ~ ? [X0] :
~ ( ~ ! [X1] :
( ~ ! [X0] :
( ! [X1] :
( p1(X1)
| ~ r1(X0,X1) )
| ~ r1(X1,X0)
| ~ ! [X1] :
( p1(X1)
| ~ r1(X0,X1) ) )
| $false
| ~ r1(X0,X1) )
| $false ),
inference(negated_conjecture,[],[f3]) ).
fof(f3,conjecture,
~ ? [X0] :
~ ( ~ ! [X1] :
( ~ ! [X0] :
( ! [X1] :
( p1(X1)
| ~ r1(X0,X1) )
| ~ r1(X1,X0)
| ~ ! [X1] :
( p1(X1)
| ~ r1(X0,X1) ) )
| $false
| ~ r1(X0,X1) )
| $false ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).
fof(f33,plain,
! [X0] : ~ r1(sK0,X0),
inference(subsumption_resolution,[],[f32,f22]) ).
fof(f22,plain,
! [X1] :
( ~ r1(sK0,X1)
| ~ p1(sK2(X1)) ),
inference(cnf_transformation,[],[f16]) ).
fof(f32,plain,
! [X0] :
( p1(sK2(X0))
| ~ r1(sK0,X0) ),
inference(duplicate_literal_removal,[],[f30]) ).
fof(f30,plain,
! [X0] :
( ~ r1(sK0,X0)
| ~ r1(sK0,X0)
| p1(sK2(X0)) ),
inference(resolution,[],[f19,f21]) ).
fof(f21,plain,
! [X1] :
( r1(sK1(X1),sK2(X1))
| ~ r1(sK0,X1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f19,plain,
! [X1,X4] :
( ~ r1(sK1(X1),X4)
| p1(X4)
| ~ r1(sK0,X1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f18,plain,
! [X0] : r1(X0,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0] : r1(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL678+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.12/0.33 % Computer : n013.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 : Tue Aug 30 02:23:16 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.46 % (18489)lrs-11_1:1_nm=0:sac=on:sd=4:ss=axioms:st=3.0:i=24:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/24Mi)
% 0.19/0.47 % (18481)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.47 % (18481)First to succeed.
% 0.19/0.47 % (18481)Refutation found. Thanks to Tanya!
% 0.19/0.47 % SZS status Theorem for theBenchmark
% 0.19/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.47 % (18481)------------------------------
% 0.19/0.47 % (18481)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.47 % (18481)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.47 % (18481)Termination reason: Refutation
% 0.19/0.47
% 0.19/0.47 % (18481)Memory used [KB]: 5884
% 0.19/0.47 % (18481)Time elapsed: 0.086 s
% 0.19/0.47 % (18481)Instructions burned: 2 (million)
% 0.19/0.47 % (18481)------------------------------
% 0.19/0.47 % (18481)------------------------------
% 0.19/0.47 % (18459)Success in time 0.131 s
%------------------------------------------------------------------------------