TSTP Solution File: LCL022-1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LCL022-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n016.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:43:48 EDT 2024
% Result : Unsatisfiable 0.16s 0.37s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 6 unt; 0 def)
% Number of atoms : 49 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 59 ( 32 ~; 27 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 44 ( 44 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1105,plain,
$false,
inference(resolution,[],[f1095,f277]) ).
fof(f277,plain,
! [X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X1,X0))),
inference(resolution,[],[f218,f2]) ).
fof(f2,axiom,
! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X1),equivalent(X0,X2)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',yql) ).
fof(f218,plain,
! [X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(X0,X0),X1))
| is_a_theorem(X1) ),
inference(resolution,[],[f189,f119]) ).
fof(f119,plain,
! [X0,X1] :
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X1)))
| is_a_theorem(X0) ),
inference(resolution,[],[f109,f32]) ).
fof(f32,plain,
! [X0] : is_a_theorem(equivalent(X0,X0)),
inference(resolution,[],[f28,f2]) ).
fof(f28,plain,
! [X0] :
( ~ is_a_theorem(equivalent(X0,equivalent(X0,X0)))
| is_a_theorem(X0) ),
inference(factoring,[],[f19]) ).
fof(f19,plain,
! [X0,X1] :
( ~ is_a_theorem(equivalent(X1,equivalent(X1,X0)))
| ~ is_a_theorem(equivalent(X0,equivalent(X1,X0)))
| is_a_theorem(X0) ),
inference(resolution,[],[f15,f4]) ).
fof(f4,plain,
! [X2,X0,X1] :
( is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X2,X0)))
| ~ is_a_theorem(equivalent(X2,X1)) ),
inference(resolution,[],[f2,f1]) ).
fof(f1,axiom,
! [X0,X1] :
( ~ is_a_theorem(equivalent(X0,X1))
| is_a_theorem(X1)
| ~ is_a_theorem(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
fof(f15,plain,
! [X2,X3] :
( ~ is_a_theorem(equivalent(equivalent(X2,X3),X3))
| ~ is_a_theorem(equivalent(X2,X3))
| is_a_theorem(X2) ),
inference(factoring,[],[f6]) ).
fof(f6,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(X2,X1))
| ~ is_a_theorem(equivalent(X0,X1))
| is_a_theorem(X2)
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f5,f1]) ).
fof(f5,plain,
! [X2,X0,X1] :
( is_a_theorem(equivalent(X0,X2))
| ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(equivalent(X2,X1)) ),
inference(resolution,[],[f4,f1]) ).
fof(f109,plain,
! [X6,X4,X5] :
( ~ is_a_theorem(equivalent(X4,equivalent(X5,X5)))
| ~ is_a_theorem(equivalent(X5,X6))
| is_a_theorem(X4) ),
inference(factoring,[],[f12]) ).
fof(f12,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| ~ is_a_theorem(equivalent(X2,X3))
| ~ is_a_theorem(equivalent(X1,X3))
| is_a_theorem(X0) ),
inference(resolution,[],[f6,f4]) ).
fof(f189,plain,
! [X0,X1] :
( is_a_theorem(equivalent(X1,X0))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(resolution,[],[f106,f32]) ).
fof(f106,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X2)))
| ~ is_a_theorem(equivalent(X2,X1))
| is_a_theorem(X0) ),
inference(resolution,[],[f12,f32]) ).
fof(f1095,plain,
~ is_a_theorem(equivalent(equivalent(b,c),equivalent(c,b))),
inference(resolution,[],[f156,f32]) ).
fof(f156,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(c,a)),equivalent(equivalent(X2,X1),equivalent(X0,X2))))
| ~ is_a_theorem(equivalent(equivalent(b,c),equivalent(X0,X1))) ),
inference(resolution,[],[f18,f2]) ).
fof(f18,plain,
! [X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(b,c),X0))
| ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(c,a)),X1))
| ~ is_a_theorem(equivalent(X0,X1)) ),
inference(resolution,[],[f7,f5]) ).
fof(f7,plain,
! [X0] :
( ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(c,a)),X0))
| ~ is_a_theorem(equivalent(equivalent(b,c),X0)) ),
inference(resolution,[],[f5,f3]) ).
fof(f3,axiom,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(c,a)),equivalent(b,c))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ec_1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : LCL022-1 : TPTP v8.1.2. Released v1.0.0.
% 0.09/0.11 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.10/0.31 % Computer : n016.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 14:30:30 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.10/0.31 % (17176)Running in auto input_syntax mode. Trying TPTP
% 0.16/0.33 % (17180)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.16/0.33 % (17177)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.16/0.33 % (17178)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.16/0.33 % (17181)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.16/0.33 % (17179)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.16/0.33 % (17183)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.16/0.33 % (17182)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.16/0.33 TRYING [1]
% 0.16/0.33 TRYING [1]
% 0.16/0.33 TRYING [1]
% 0.16/0.33 TRYING [1]
% 0.16/0.33 TRYING [2]
% 0.16/0.33 TRYING [2]
% 0.16/0.33 TRYING [2]
% 0.16/0.33 TRYING [2]
% 0.16/0.33 TRYING [3]
% 0.16/0.33 TRYING [3]
% 0.16/0.33 TRYING [3]
% 0.16/0.33 TRYING [3]
% 0.16/0.34 TRYING [4]
% 0.16/0.34 TRYING [4]
% 0.16/0.34 TRYING [4]
% 0.16/0.34 TRYING [4]
% 0.16/0.37 % (17179)First to succeed.
% 0.16/0.37 % (17179)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-17176"
% 0.16/0.37 % (17179)Refutation found. Thanks to Tanya!
% 0.16/0.37 % SZS status Unsatisfiable for theBenchmark
% 0.16/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.37 % (17179)------------------------------
% 0.16/0.37 % (17179)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.16/0.37 % (17179)Termination reason: Refutation
% 0.16/0.37
% 0.16/0.37 % (17179)Memory used [KB]: 1185
% 0.16/0.37 % (17179)Time elapsed: 0.047 s
% 0.16/0.37 % (17179)Instructions burned: 105 (million)
% 0.16/0.37 % (17176)Success in time 0.062 s
%------------------------------------------------------------------------------