TSTP Solution File: LCL012-1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LCL012-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n019.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 May 21 00:24:24 EDT 2024
% Result : Unsatisfiable 18.41s 3.01s
% Output : Refutation 18.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 3
% Syntax : Number of formulae : 34 ( 22 unt; 0 def)
% Number of atoms : 47 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 27 ( 14 ~; 13 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 8 ( 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 : 94 ( 94 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f137998,plain,
$false,
inference(resolution,[],[f72912,f3]) ).
fof(f3,axiom,
~ is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(c,a),equivalent(b,c)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_yqj) ).
fof(f72912,plain,
! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X0),equivalent(X1,X2)))),
inference(resolution,[],[f37559,f16975]) ).
fof(f16975,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(X1,equivalent(X2,X0)))
| is_a_theorem(equivalent(equivalent(X0,X1),X2)) ),
inference(resolution,[],[f16114,f1]) ).
fof(f1,axiom,
! [X0,X1] :
( ~ is_a_theorem(equivalent(X0,X1))
| is_a_theorem(X1)
| ~ is_a_theorem(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
fof(f16114,plain,
! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(equivalent(X2,X0),X1))),
inference(resolution,[],[f14643,f59]) ).
fof(f59,plain,
! [X2,X3,X0,X1] : is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(X2,equivalent(X3,X1))),X0))),
inference(resolution,[],[f56,f17]) ).
fof(f17,plain,
! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(equivalent(X2,X3),X4),equivalent(X3,equivalent(X4,X2))),X0)))
| is_a_theorem(equivalent(X0,X1)) ),
inference(resolution,[],[f8,f1]) ).
fof(f8,plain,
! [X2,X3,X0,X1,X4] : is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(X2,equivalent(X3,X1))),X4)),equivalent(X4,X0))),
inference(resolution,[],[f7,f2]) ).
fof(f2,axiom,
! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(X1,equivalent(X2,X0)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',um) ).
fof(f7,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(X1)
| is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X2,X0))) ),
inference(resolution,[],[f5,f1]) ).
fof(f5,plain,
! [X2,X0,X1] : is_a_theorem(equivalent(X0,equivalent(equivalent(X1,equivalent(X0,X2)),equivalent(X2,X1)))),
inference(resolution,[],[f4,f2]) ).
fof(f4,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(X2,X0),X1))
| is_a_theorem(equivalent(X0,equivalent(X1,X2))) ),
inference(resolution,[],[f2,f1]) ).
fof(f56,plain,
! [X0] : is_a_theorem(equivalent(X0,X0)),
inference(resolution,[],[f45,f43]) ).
fof(f43,plain,
! [X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X1),X0)),
inference(resolution,[],[f38,f5]) ).
fof(f38,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X2,X0),X1)))
| is_a_theorem(X0) ),
inference(resolution,[],[f36,f1]) ).
fof(f36,plain,
! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X1,X2),X0)),X2)),
inference(resolution,[],[f17,f5]) ).
fof(f45,plain,
! [X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(X0,X1),X1))
| is_a_theorem(X0) ),
inference(resolution,[],[f43,f1]) ).
fof(f14643,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),X2)))
| is_a_theorem(equivalent(X0,X1)) ),
inference(resolution,[],[f14524,f1]) ).
fof(f14524,plain,
! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),X2)),equivalent(X0,X1))),
inference(resolution,[],[f14461,f4]) ).
fof(f14461,plain,
! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(X0,equivalent(X1,equivalent(equivalent(X0,X2),X2))),X1)),
inference(resolution,[],[f12801,f17]) ).
fof(f12801,plain,
! [X2,X3,X0,X1] : is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),X2),X1),X0),X3),X3))),
inference(resolution,[],[f11941,f43]) ).
fof(f11941,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(equivalent(X2,X3),X3),X2),X0)))
| is_a_theorem(equivalent(X0,X1)) ),
inference(resolution,[],[f48,f1]) ).
fof(f48,plain,
! [X2,X3,X0,X1] : is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(equivalent(equivalent(X1,X2),X2),X1),X3)),equivalent(X3,X0))),
inference(resolution,[],[f43,f7]) ).
fof(f37559,plain,
! [X2,X0,X1] : is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(X1,X2),equivalent(X0,X1)),X2))),
inference(resolution,[],[f24488,f16939]) ).
fof(f16939,plain,
! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(equivalent(X1,X2),X0),X2))),
inference(resolution,[],[f16114,f4]) ).
fof(f24488,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(equivalent(X0,X2),X2),X1))
| is_a_theorem(equivalent(X0,X1)) ),
inference(resolution,[],[f18216,f1]) ).
fof(f18216,plain,
! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),X1),X2),equivalent(X0,X2))),
inference(resolution,[],[f16190,f4]) ).
fof(f16190,plain,
! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(equivalent(X1,X2),X2),X0)),X1)),
inference(resolution,[],[f14643,f144]) ).
fof(f144,plain,
! [X0,X1] : is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X0)),X1)),
inference(resolution,[],[f124,f2]) ).
fof(f124,plain,
! [X0,X1] :
( ~ is_a_theorem(equivalent(X0,equivalent(X1,X1)))
| is_a_theorem(X0) ),
inference(resolution,[],[f107,f1]) ).
fof(f107,plain,
! [X0,X1] : is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X1)),X0)),
inference(resolution,[],[f76,f56]) ).
fof(f76,plain,
! [X0,X1] :
( ~ is_a_theorem(X1)
| is_a_theorem(equivalent(equivalent(X0,X1),X0)) ),
inference(resolution,[],[f57,f1]) ).
fof(f57,plain,
! [X0,X1] : is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X0),X1))),
inference(resolution,[],[f56,f4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : LCL012-1 : TPTP v8.2.0. Released v1.0.0.
% 0.08/0.15 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.16/0.37 % Computer : n019.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Mon May 20 02:58:08 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.16/0.37 % (30596)Running in auto input_syntax mode. Trying TPTP
% 0.16/0.39 % (30603)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.39 % (30602)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.16/0.39 TRYING [1]
% 0.16/0.39 % (30597)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.16/0.39 TRYING [2]
% 0.16/0.39 % (30598)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.16/0.39 % (30599)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.39 % (30600)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.39 % (30601)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.16/0.39 TRYING [1]
% 0.16/0.39 TRYING [1]
% 0.16/0.39 TRYING [3]
% 0.16/0.39 TRYING [2]
% 0.16/0.39 TRYING [1]
% 0.16/0.39 TRYING [2]
% 0.16/0.39 TRYING [2]
% 0.16/0.39 TRYING [3]
% 0.16/0.39 TRYING [3]
% 0.16/0.39 TRYING [3]
% 0.16/0.39 TRYING [4]
% 0.16/0.40 TRYING [4]
% 0.16/0.40 TRYING [4]
% 0.16/0.40 TRYING [4]
% 0.23/0.53 TRYING [5]
% 0.23/0.54 TRYING [5]
% 0.23/0.55 TRYING [5]
% 0.23/0.56 TRYING [5]
% 18.41/3.00 % (30601)First to succeed.
% 18.41/3.00 % (30601)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-30596"
% 18.41/3.01 % (30601)Refutation found. Thanks to Tanya!
% 18.41/3.01 % SZS status Unsatisfiable for theBenchmark
% 18.41/3.01 % SZS output start Proof for theBenchmark
% See solution above
% 18.41/3.01 % (30601)------------------------------
% 18.41/3.01 % (30601)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 18.41/3.01 % (30601)Termination reason: Refutation
% 18.41/3.01
% 18.41/3.01 % (30601)Memory used [KB]: 40299
% 18.41/3.01 % (30601)Time elapsed: 2.617 s
% 18.41/3.01 % (30601)Instructions burned: 8434 (million)
% 18.41/3.01 % (30596)Success in time 2.609 s
%------------------------------------------------------------------------------