TSTP Solution File: LCL167-1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LCL167-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 : n005.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:15 EDT 2024
% Result : Unsatisfiable 39.84s 6.03s
% Output : Refutation 39.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 5
% Syntax : Number of formulae : 42 ( 6 unt; 0 def)
% Number of atoms : 109 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 136 ( 69 ~; 65 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 7 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 3 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 138 ( 138 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f44012,plain,
$false,
inference(avatar_sat_refutation,[],[f64,f73,f44010]) ).
fof(f44010,plain,
~ spl0_5,
inference(avatar_contradiction_clause,[],[f43517]) ).
fof(f43517,plain,
( $false
| ~ spl0_5 ),
inference(resolution,[],[f10223,f3]) ).
fof(f3,axiom,
~ is_a_theorem(equivalent(equivalent(a,b),equivalent(c,equivalent(equivalent(c,b),a)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_yro) ).
fof(f10223,plain,
( ! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X2,equivalent(equivalent(X2,X1),X0))))
| ~ spl0_5 ),
inference(resolution,[],[f2984,f2483]) ).
fof(f2483,plain,
( ! [X0,X1] :
( ~ is_a_theorem(equivalent(X1,X0))
| is_a_theorem(equivalent(X0,X1)) )
| ~ spl0_5 ),
inference(resolution,[],[f2077,f72]) ).
fof(f72,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(X2,X1),X0))
| is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(X2) )
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f71]) ).
fof(f71,plain,
( spl0_5
<=> ! [X2,X0,X1] :
( is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(equivalent(equivalent(X2,X1),X0))
| ~ is_a_theorem(X2) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_5])]) ).
fof(f2077,plain,
( ! [X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X0),X1))
| ~ spl0_5 ),
inference(resolution,[],[f1876,f463]) ).
fof(f463,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(equivalent(X2,X1),X0),X2))
| is_a_theorem(equivalent(X0,X1)) ),
inference(resolution,[],[f454,f6]) ).
fof(f6,plain,
! [X2,X3,X0,X1] :
( is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X2),X1))),X3))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f5,f2]) ).
fof(f2,axiom,
! [X2,X0,X1] : is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(equivalent(X0,X2),X1)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xhk) ).
fof(f5,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(X2,X1))
| is_a_theorem(equivalent(equivalent(X0,X1),X2))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f4,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(f4,plain,
! [X2,X0,X1] :
( is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X1),X0)))
| ~ is_a_theorem(X2) ),
inference(resolution,[],[f2,f1]) ).
fof(f454,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X0,X1)),X2))
| is_a_theorem(X0) ),
inference(resolution,[],[f446,f2]) ).
fof(f446,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(X1,X0),X2),X3)))
| is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X3,X2)) ),
inference(resolution,[],[f219,f4]) ).
fof(f219,plain,
! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(equivalent(X3,X4),X2),X1)),X4)))
| ~ is_a_theorem(X0)
| is_a_theorem(X3) ),
inference(resolution,[],[f196,f2]) ).
fof(f196,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(X0,X3),X2))
| ~ is_a_theorem(equivalent(X1,equivalent(X2,X3)))
| ~ is_a_theorem(X1)
| is_a_theorem(X0) ),
inference(resolution,[],[f53,f2]) ).
fof(f53,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(X3,X4)),equivalent(X5,equivalent(equivalent(X0,X4),X3)))))
| is_a_theorem(X0)
| ~ is_a_theorem(X5)
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X2) ),
inference(resolution,[],[f14,f7]) ).
fof(f7,plain,
! [X2,X3,X0,X1] :
( is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),X3)),equivalent(X3,X2)))
| ~ is_a_theorem(X0)
| ~ is_a_theorem(X1) ),
inference(resolution,[],[f5,f4]) ).
fof(f14,plain,
! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(equivalent(X0,X3),X4)),equivalent(X4,X3))))
| is_a_theorem(X0)
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X2) ),
inference(resolution,[],[f9,f7]) ).
fof(f9,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X2,X3),equivalent(equivalent(X1,X3),X2))))
| is_a_theorem(X1)
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f6,f1]) ).
fof(f1876,plain,
( ! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X1),X0)),X2))
| ~ spl0_5 ),
inference(resolution,[],[f1668,f463]) ).
fof(f1668,plain,
( ! [X2,X3,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X3),equivalent(equivalent(X0,X3),X2))),X1))
| ~ spl0_5 ),
inference(resolution,[],[f869,f463]) ).
fof(f869,plain,
( ! [X2,X3,X0,X1,X4] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X1),X0)),equivalent(equivalent(X3,X4),equivalent(equivalent(X2,X4),X3))))
| ~ spl0_5 ),
inference(resolution,[],[f331,f463]) ).
fof(f331,plain,
( ! [X2,X3,X0,X1,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(equivalent(X0,X2),X1))),equivalent(equivalent(X3,X4),equivalent(equivalent(X5,X4),X3))),X5))
| ~ spl0_5 ),
inference(subsumption_resolution,[],[f290,f2]) ).
fof(f290,plain,
( ! [X2,X3,X0,X1,X8,X6,X7,X4,X5] :
( is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(equivalent(X0,X2),X1))),equivalent(equivalent(X3,X4),equivalent(equivalent(X5,X4),X3))),X5))
| ~ is_a_theorem(equivalent(X6,equivalent(equivalent(X7,X8),equivalent(equivalent(X6,X8),X7)))) )
| ~ spl0_5 ),
inference(resolution,[],[f94,f72]) ).
fof(f94,plain,
! [X2,X3,X0,X1,X8,X6,X7,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(equivalent(X0,X2),X1))),X3),equivalent(equivalent(X4,equivalent(equivalent(X5,X6),equivalent(equivalent(X4,X6),X5))),equivalent(equivalent(X7,X8),equivalent(equivalent(X3,X8),X7))))),
inference(resolution,[],[f23,f2]) ).
fof(f23,plain,
! [X2,X3,X0,X1,X6,X4,X5] :
( ~ is_a_theorem(X4)
| is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(equivalent(X0,X2),X1))),X3),equivalent(X4,equivalent(equivalent(X5,X6),equivalent(equivalent(X3,X6),X5))))) ),
inference(resolution,[],[f8,f2]) ).
fof(f8,plain,
! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(X1)
| is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X0,equivalent(equivalent(X3,X4),equivalent(equivalent(X2,X4),X3)))))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f6,f5]) ).
fof(f2984,plain,
( ! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(X0,X1),X2)),equivalent(X2,X1)))
| ~ spl0_5 ),
inference(resolution,[],[f2506,f869]) ).
fof(f2506,plain,
( ! [X0,X1] :
( ~ is_a_theorem(equivalent(equivalent(X1,X0),X1))
| is_a_theorem(X0) )
| ~ spl0_5 ),
inference(resolution,[],[f2077,f1]) ).
fof(f73,plain,
( spl0_1
| spl0_5 ),
inference(avatar_split_clause,[],[f69,f71,f42]) ).
fof(f42,plain,
( spl0_1
<=> ! [X4] : ~ is_a_theorem(X4) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
fof(f69,plain,
! [X2,X3,X0,X1] :
( is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(X2)
| ~ is_a_theorem(equivalent(equivalent(X2,X1),X0))
| ~ is_a_theorem(X3) ),
inference(duplicate_literal_removal,[],[f66]) ).
fof(f66,plain,
! [X2,X3,X0,X1] :
( is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(X2)
| ~ is_a_theorem(equivalent(equivalent(X2,X1),X0))
| ~ is_a_theorem(X3)
| ~ is_a_theorem(X3) ),
inference(resolution,[],[f20,f4]) ).
fof(f20,plain,
! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(equivalent(X3,equivalent(equivalent(X4,X1),equivalent(X0,X2))))
| is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X0)
| ~ is_a_theorem(X3)
| ~ is_a_theorem(X4) ),
inference(resolution,[],[f11,f7]) ).
fof(f11,plain,
! [X2,X3,X0,X1] :
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(X1,X3),X2)))
| ~ is_a_theorem(X1)
| is_a_theorem(equivalent(X2,X3))
| ~ is_a_theorem(X0) ),
inference(resolution,[],[f7,f1]) ).
fof(f64,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f60]) ).
fof(f60,plain,
( $false
| ~ spl0_1 ),
inference(resolution,[],[f43,f2]) ).
fof(f43,plain,
( ! [X4] : ~ is_a_theorem(X4)
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : LCL167-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.11 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.10/0.31 % Computer : n005.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:58:10 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.10/0.31 % (19328)Running in auto input_syntax mode. Trying TPTP
% 0.16/0.32 % (19333)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.16/0.32 % (19331)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.32 % (19335)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.32 % (19334)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.16/0.32 % (19330)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.16/0.32 % (19329)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.16/0.32 % (19332)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.32 TRYING [1]
% 0.16/0.32 TRYING [1]
% 0.16/0.32 TRYING [2]
% 0.16/0.32 TRYING [2]
% 0.16/0.32 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 [3]
% 0.16/0.33 TRYING [3]
% 0.16/0.33 TRYING [3]
% 0.16/0.33 TRYING [3]
% 0.16/0.33 TRYING [4]
% 0.16/0.33 TRYING [4]
% 0.16/0.33 TRYING [4]
% 0.16/0.33 TRYING [4]
% 0.16/0.45 TRYING [5]
% 0.16/0.46 TRYING [5]
% 0.16/0.47 TRYING [5]
% 0.16/0.47 TRYING [5]
% 39.84/6.02 % (19334)First to succeed.
% 39.84/6.02 % (19334)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-19328"
% 39.84/6.03 % (19334)Refutation found. Thanks to Tanya!
% 39.84/6.03 % SZS status Unsatisfiable for theBenchmark
% 39.84/6.03 % SZS output start Proof for theBenchmark
% See solution above
% 39.84/6.03 % (19334)------------------------------
% 39.84/6.03 % (19334)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 39.84/6.03 % (19334)Termination reason: Refutation
% 39.84/6.03
% 39.84/6.03 % (19334)Memory used [KB]: 24954
% 39.84/6.03 % (19334)Time elapsed: 5.689 s
% 39.84/6.03 % (19334)Instructions burned: 13315 (million)
% 39.84/6.03 % (19328)Success in time 5.7 s
%------------------------------------------------------------------------------