TSTP Solution File: LCL096-1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LCL096-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 : n031.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:44:02 EDT 2024
% Result : Unsatisfiable 2.90s 0.84s
% Output : Refutation 2.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 31 ( 21 unt; 0 def)
% Number of atoms : 42 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 23 ( 12 ~; 11 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 7 ( 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 : 113 ( 113 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f27721,plain,
$false,
inference(resolution,[],[f27533,f5]) ).
fof(f5,axiom,
~ is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(equivalent(b,b),a)),c),c)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_lg_1) ).
fof(f27533,plain,
! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(equivalent(X1,X1),X0)),X2),X2)),
inference(resolution,[],[f5077,f6563]) ).
fof(f6563,plain,
! [X2,X3,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X0),equivalent(X1,X2)),equivalent(equivalent(X2,X1),X3)),X3)),
inference(resolution,[],[f2224,f260]) ).
fof(f260,plain,
! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X0),X1),X2),equivalent(X1,X2))),
inference(resolution,[],[f153,f31]) ).
fof(f31,plain,
! [X0,X1] : is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X1),X0))),
inference(resolution,[],[f28,f4]) ).
fof(f4,axiom,
! [X2,X3,X0,X1,X4] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),X2),X3),equivalent(equivalent(equivalent(X0,X4),X2),equivalent(equivalent(X1,X4),X3)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lg_4) ).
fof(f28,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(X2,X0),equivalent(X2,X1)))
| is_a_theorem(equivalent(X0,X1)) ),
inference(resolution,[],[f18,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(f18,plain,
! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(X1,X2))),
inference(resolution,[],[f14,f6]) ).
fof(f6,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),X0))
| is_a_theorem(X0) ),
inference(resolution,[],[f2,f1]) ).
fof(f2,axiom,
! [X2,X3,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(X1,X2)),X3),X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lg_2) ).
fof(f14,plain,
! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(X0,equivalent(X1,X2)))),
inference(resolution,[],[f10,f8]) ).
fof(f8,plain,
! [X2,X3,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(equivalent(X3,X1),equivalent(X3,X2)))),
inference(resolution,[],[f4,f6]) ).
fof(f10,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(X3,X1),equivalent(X3,X2)))
| is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X0,X2))) ),
inference(resolution,[],[f8,f1]) ).
fof(f153,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(equivalent(X2,equivalent(X0,X3)))
| is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(X1,X3))) ),
inference(resolution,[],[f142,f1]) ).
fof(f142,plain,
! [X2,X3,X0,X1] : is_a_theorem(equivalent(equivalent(X0,equivalent(X1,X2)),equivalent(equivalent(equivalent(X1,X3),X0),equivalent(X3,X2)))),
inference(resolution,[],[f72,f6]) ).
fof(f72,plain,
! [X2,X3,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(X3,X1),equivalent(equivalent(X0,X3),X2)))),
inference(resolution,[],[f7,f3]) ).
fof(f3,axiom,
! [X2,X3,X0,X1,X4] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),equivalent(equivalent(X1,X2),X3)),X4),X4)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lg_3) ).
fof(f7,plain,
! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4),equivalent(equivalent(X2,X3),X4)),X0))
| is_a_theorem(X0) ),
inference(resolution,[],[f3,f1]) ).
fof(f2224,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X2,X3),equivalent(equivalent(X3,X2),X1))))
| is_a_theorem(equivalent(X0,X1)) ),
inference(resolution,[],[f824,f1]) ).
fof(f824,plain,
! [X2,X3,X0,X1] : is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(equivalent(X2,X1),X3))),equivalent(X0,X3))),
inference(resolution,[],[f769,f10]) ).
fof(f769,plain,
! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X1,X0),X2)),X2)),
inference(resolution,[],[f731,f630]) ).
fof(f630,plain,
! [X2,X3,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X0),X3)),equivalent(equivalent(X2,X1),X3))),
inference(resolution,[],[f263,f6]) ).
fof(f263,plain,
! [X2,X3,X0,X1,X4] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),X4),equivalent(equivalent(equivalent(X1,X2),X3),X4))),
inference(resolution,[],[f9,f2]) ).
fof(f9,plain,
! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(equivalent(equivalent(equivalent(X0,X3),X2),X4))
| is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(X3,X1),X4))) ),
inference(resolution,[],[f4,f1]) ).
fof(f731,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X2,X2),X1)))
| is_a_theorem(equivalent(X0,X1)) ),
inference(resolution,[],[f648,f1]) ).
fof(f648,plain,
! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(X1,X1),X2)),equivalent(X0,X2))),
inference(resolution,[],[f630,f10]) ).
fof(f5077,plain,
! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(equivalent(equivalent(equivalent(X4,X1),equivalent(equivalent(X0,X4),X2)),X3))
| is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),X3)) ),
inference(resolution,[],[f1047,f1]) ).
fof(f1047,plain,
! [X2,X3,X0,X1,X4] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X0),X3)),X4),equivalent(equivalent(equivalent(X2,X1),X3),X4))),
inference(resolution,[],[f264,f7]) ).
fof(f264,plain,
! [X2,X3,X0,X1,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),X4),X5),equivalent(equivalent(equivalent(equivalent(X1,X2),X3),X4),X5))),
inference(resolution,[],[f9,f3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : LCL096-1 : TPTP v8.1.2. Released v1.0.0.
% 0.08/0.15 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36 % Computer : n031.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 13:59:32 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.37 % (32185)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.38 % (32187)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.15/0.38 % (32190)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.15/0.38 % (32188)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.15/0.38 % (32192)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.15/0.38 % (32189)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.15/0.38 % (32193)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.15/0.38 % (32191)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.15/0.39 TRYING [1]
% 0.15/0.39 TRYING [1]
% 0.15/0.39 TRYING [1]
% 0.15/0.39 TRYING [1]
% 0.15/0.39 TRYING [2]
% 0.15/0.39 TRYING [2]
% 0.15/0.39 TRYING [2]
% 0.15/0.39 TRYING [2]
% 0.15/0.39 TRYING [3]
% 0.15/0.39 TRYING [3]
% 0.15/0.39 TRYING [3]
% 0.15/0.39 TRYING [3]
% 0.23/0.41 TRYING [4]
% 0.23/0.41 TRYING [4]
% 0.23/0.41 TRYING [4]
% 0.23/0.41 TRYING [4]
% 0.23/0.52 TRYING [5]
% 0.23/0.53 TRYING [5]
% 0.23/0.53 TRYING [5]
% 0.23/0.54 TRYING [5]
% 2.90/0.84 % (32191)First to succeed.
% 2.90/0.84 % (32191)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-32185"
% 2.90/0.84 % (32191)Refutation found. Thanks to Tanya!
% 2.90/0.84 % SZS status Unsatisfiable for theBenchmark
% 2.90/0.84 % SZS output start Proof for theBenchmark
% See solution above
% 2.90/0.84 % (32191)------------------------------
% 2.90/0.84 % (32191)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 2.90/0.84 % (32191)Termination reason: Refutation
% 2.90/0.84
% 2.90/0.84 % (32191)Memory used [KB]: 7946
% 2.90/0.84 % (32191)Time elapsed: 0.460 s
% 2.90/0.84 % (32191)Instructions burned: 1471 (million)
% 2.90/0.84 % (32185)Success in time 0.47 s
%------------------------------------------------------------------------------