TSTP Solution File: LCL678+1.001 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LCL678+1.001 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n003.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 : Sun May 5 07:52:39 EDT 2024
% Result : Theorem 0.10s 0.33s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 20 ( 5 unt; 0 def)
% Number of atoms : 90 ( 0 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 141 ( 71 ~; 47 |; 20 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 7 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 : 56 ( 39 !; 17 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f56,plain,
$false,
inference(subsumption_resolution,[],[f55,f19]) ).
fof(f19,plain,
! [X0] : r1(X0,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0] : r1(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity) ).
fof(f55,plain,
~ r1(sK0,sK0),
inference(resolution,[],[f30,f17]) ).
fof(f17,plain,
! [X1] :
( ~ p1(sK2(X1))
| ~ r1(sK0,X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X1] :
( ( ! [X3] :
( p1(X3)
| ~ r1(sK1(X1),X3) )
& ~ p1(sK2(X1))
& r1(sK1(X1),sK2(X1))
& r1(X1,sK1(X1)) )
| ~ r1(sK0,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f8,f13,f12,f11]) ).
fof(f11,plain,
( ? [X0] :
! [X1] :
( ? [X2] :
( ! [X3] :
( p1(X3)
| ~ r1(X2,X3) )
& ? [X4] :
( ~ p1(X4)
& r1(X2,X4) )
& r1(X1,X2) )
| ~ r1(X0,X1) )
=> ! [X1] :
( ? [X2] :
( ! [X3] :
( p1(X3)
| ~ r1(X2,X3) )
& ? [X4] :
( ~ p1(X4)
& r1(X2,X4) )
& r1(X1,X2) )
| ~ r1(sK0,X1) ) ),
introduced(choice_axiom,[]) ).
fof(f12,plain,
! [X1] :
( ? [X2] :
( ! [X3] :
( p1(X3)
| ~ r1(X2,X3) )
& ? [X4] :
( ~ p1(X4)
& r1(X2,X4) )
& r1(X1,X2) )
=> ( ! [X3] :
( p1(X3)
| ~ r1(sK1(X1),X3) )
& ? [X4] :
( ~ p1(X4)
& r1(sK1(X1),X4) )
& r1(X1,sK1(X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
! [X1] :
( ? [X4] :
( ~ p1(X4)
& r1(sK1(X1),X4) )
=> ( ~ p1(sK2(X1))
& r1(sK1(X1),sK2(X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
? [X0] :
! [X1] :
( ? [X2] :
( ! [X3] :
( p1(X3)
| ~ r1(X2,X3) )
& ? [X4] :
( ~ p1(X4)
& r1(X2,X4) )
& r1(X1,X2) )
| ~ r1(X0,X1) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,plain,
? [X0] :
! [X1] :
( ~ ! [X2] :
( ~ ! [X3] :
( p1(X3)
| ~ r1(X2,X3) )
| ! [X4] :
( p1(X4)
| ~ r1(X2,X4) )
| ~ r1(X1,X2) )
| ~ r1(X0,X1) ),
inference(flattening,[],[f6]) ).
fof(f6,plain,
~ ~ ? [X0] :
~ ~ ! [X1] :
( ~ ! [X2] :
( ~ ! [X3] :
( p1(X3)
| ~ r1(X2,X3) )
| ! [X4] :
( p1(X4)
| ~ r1(X2,X4) )
| ~ r1(X1,X2) )
| ~ r1(X0,X1) ),
inference(true_and_false_elimination,[],[f5]) ).
fof(f5,plain,
~ ~ ? [X0] :
~ ( ~ ! [X1] :
( ~ ! [X2] :
( ~ ! [X3] :
( p1(X3)
| ~ r1(X2,X3) )
| ! [X4] :
( p1(X4)
| ~ r1(X2,X4) )
| ~ r1(X1,X2) )
| $false
| ~ r1(X0,X1) )
| $false ),
inference(rectify,[],[f4]) ).
fof(f4,negated_conjecture,
~ ~ ? [X0] :
~ ( ~ ! [X1] :
( ~ ! [X0] :
( ~ ! [X1] :
( p1(X1)
| ~ r1(X0,X1) )
| ! [X1] :
( p1(X1)
| ~ r1(X0,X1) )
| ~ r1(X1,X0) )
| $false
| ~ r1(X0,X1) )
| $false ),
inference(negated_conjecture,[],[f3]) ).
fof(f3,conjecture,
~ ? [X0] :
~ ( ~ ! [X1] :
( ~ ! [X0] :
( ~ ! [X1] :
( p1(X1)
| ~ r1(X0,X1) )
| ! [X1] :
( p1(X1)
| ~ r1(X0,X1) )
| ~ r1(X1,X0) )
| $false
| ~ r1(X0,X1) )
| $false ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main) ).
fof(f30,plain,
p1(sK2(sK0)),
inference(subsumption_resolution,[],[f27,f19]) ).
fof(f27,plain,
( p1(sK2(sK0))
| ~ r1(sK0,sK0) ),
inference(resolution,[],[f21,f16]) ).
fof(f16,plain,
! [X1] :
( r1(sK1(X1),sK2(X1))
| ~ r1(sK0,X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f21,plain,
! [X0] :
( ~ r1(sK1(sK0),X0)
| p1(X0) ),
inference(resolution,[],[f18,f19]) ).
fof(f18,plain,
! [X3,X1] :
( ~ r1(sK0,X1)
| ~ r1(sK1(X1),X3)
| p1(X3) ),
inference(cnf_transformation,[],[f14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : LCL678+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.05/0.11 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.10/0.31 % Computer : n003.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 : Fri May 3 13:33:20 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.10/0.32 % (9253)Running in auto input_syntax mode. Trying TPTP
% 0.10/0.33 % (9259)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.10/0.33 % (9255)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.10/0.33 % (9256)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.10/0.33 % (9258)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.10/0.33 TRYING [1]
% 0.10/0.33 % (9257)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.10/0.33 % (9256)Also succeeded, but the first one will report.
% 0.10/0.33 % (9259)First to succeed.
% 0.10/0.33 % (9254)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.10/0.33 TRYING [2]
% 0.10/0.33 % (9260)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2:si=on:rtra=on:rawr=on:rp=on:fmbksg=on_1451 on theBenchmark for (1451ds/0Mi)
% 0.10/0.33 TRYING [3]
% 0.10/0.33 % (9259)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-9253"
% 0.10/0.33 % (9258)Also succeeded, but the first one will report.
% 0.10/0.33 TRYING [1]
% 0.10/0.33 TRYING [1]
% 0.10/0.33 TRYING [4]
% 0.10/0.33 TRYING [2]
% 0.10/0.33 TRYING [1]
% 0.10/0.33 TRYING [2]
% 0.10/0.33 TRYING [3]
% 0.10/0.33 TRYING [2]
% 0.10/0.33 % (9259)Refutation found. Thanks to Tanya!
% 0.10/0.33 % SZS status Theorem for theBenchmark
% 0.10/0.33 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.33 % (9259)------------------------------
% 0.10/0.33 % (9259)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.10/0.33 % (9259)Termination reason: Refutation
% 0.10/0.33
% 0.10/0.33 % (9259)Memory used [KB]: 750
% 0.10/0.33 % (9259)Time elapsed: 0.004 s
% 0.10/0.33 % (9259)Instructions burned: 3 (million)
% 0.10/0.33 % (9253)Success in time 0.004 s
%------------------------------------------------------------------------------