TSTP Solution File: LCL003-1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LCL003-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 : n027.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:22 EDT 2024
% Result : Unsatisfiable 8.85s 1.67s
% Output : Refutation 8.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 10
% Syntax : Number of formulae : 62 ( 4 unt; 0 def)
% Number of atoms : 189 ( 0 equ)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 252 ( 125 ~; 120 |; 0 &)
% ( 7 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 9 ( 8 usr; 8 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 162 ( 162 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f25182,plain,
$false,
inference(avatar_sat_refutation,[],[f72,f89,f118,f449,f5847,f24999,f25021,f25181]) ).
fof(f25181,plain,
( ~ spl0_4
| ~ spl0_8
| ~ spl0_30 ),
inference(avatar_contradiction_clause,[],[f25111]) ).
fof(f25111,plain,
( $false
| ~ spl0_4
| ~ spl0_8
| ~ spl0_30 ),
inference(resolution,[],[f24832,f5883]) ).
fof(f5883,plain,
( ! [X0,X1] : is_a_theorem(or(not(X0),or(X0,X1)))
| ~ spl0_4
| ~ spl0_8 ),
inference(resolution,[],[f5812,f767]) ).
fof(f767,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(or(not(or(not(X0),or(X0,X1))),X2))
| is_a_theorem(X2) )
| ~ spl0_8 ),
inference(resolution,[],[f737,f451]) ).
fof(f451,plain,
( ! [X2,X3,X0,X1] :
( ~ is_a_theorem(or(not(or(not(X2),X3)),or(X1,X2)))
| ~ is_a_theorem(or(not(or(X1,X2)),X0))
| is_a_theorem(X0) )
| ~ spl0_8 ),
inference(resolution,[],[f448,f16]) ).
fof(f16,plain,
! [X2,X3,X0,X1,X4] :
( is_a_theorem(or(not(or(not(X0),X1)),or(X2,or(X3,X1))))
| ~ is_a_theorem(or(not(or(not(X1),X4)),or(X3,X1))) ),
inference(resolution,[],[f11,f2]) ).
fof(f2,axiom,
! [X2,X3,X0,X1,X4] : is_a_theorem(or(not(or(not(or(not(X0),X1)),or(X2,or(X3,X4)))),or(not(or(not(X3),X0)),or(X2,or(X4,X0))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',an_CAMerideth) ).
fof(f11,plain,
! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(or(not(or(not(X0),X4)),or(X2,or(X3,X1))))
| is_a_theorem(or(X2,or(X3,X1)))
| ~ is_a_theorem(or(not(X0),X1)) ),
inference(resolution,[],[f7,f4]) ).
fof(f4,plain,
! [X2,X3,X0,X1,X4] :
( is_a_theorem(or(not(or(not(X0),X1)),or(X2,or(X3,X1))))
| ~ is_a_theorem(or(not(or(not(X1),X4)),or(X2,or(X0,X3)))) ),
inference(resolution,[],[f2,f1]) ).
fof(f1,axiom,
! [X0,X1] :
( ~ is_a_theorem(or(not(X0),X1))
| is_a_theorem(X1)
| ~ is_a_theorem(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
fof(f7,plain,
! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(or(not(or(not(X1),X4)),or(X0,or(X2,X3))))
| ~ is_a_theorem(or(not(X3),X2))
| is_a_theorem(or(X0,or(X1,X2))) ),
inference(resolution,[],[f5,f4]) ).
fof(f5,plain,
! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(or(not(or(not(X0),X1)),or(X2,or(X3,X4))))
| is_a_theorem(or(X2,or(X4,X0)))
| ~ is_a_theorem(or(not(X3),X0)) ),
inference(resolution,[],[f4,f1]) ).
fof(f448,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(or(not(or(not(X0),X2)),or(X1,X0)))
| is_a_theorem(X1)
| ~ is_a_theorem(or(not(X0),X1)) )
| ~ spl0_8 ),
inference(avatar_component_clause,[],[f447]) ).
fof(f447,plain,
( spl0_8
<=> ! [X2,X0,X1] :
( ~ is_a_theorem(or(not(X0),X1))
| is_a_theorem(X1)
| ~ is_a_theorem(or(not(or(not(X0),X2)),or(X1,X0))) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_8])]) ).
fof(f737,plain,
( ! [X2,X0,X1] : is_a_theorem(or(not(or(not(X0),X1)),or(not(X2),or(X2,X1))))
| ~ spl0_8 ),
inference(resolution,[],[f688,f2]) ).
fof(f688,plain,
( ! [X2,X3,X0,X1] :
( ~ is_a_theorem(or(not(or(not(or(not(X0),X1)),or(not(X1),or(X2,X1)))),X3))
| is_a_theorem(X3) )
| ~ spl0_8 ),
inference(resolution,[],[f451,f2]) ).
fof(f5812,plain,
( ! [X2,X0,X1] : is_a_theorem(or(X0,or(not(X1),or(X1,X2))))
| ~ spl0_4
| ~ spl0_8 ),
inference(resolution,[],[f5713,f767]) ).
fof(f5713,plain,
( ! [X2,X0,X1] : is_a_theorem(or(not(or(not(X0),X1)),or(X2,or(not(X0),X1))))
| ~ spl0_4
| ~ spl0_8 ),
inference(resolution,[],[f3705,f767]) ).
fof(f3705,plain,
( ! [X2,X3,X0,X1] : is_a_theorem(or(not(or(not(X0),or(not(X1),X2))),or(not(or(not(X1),X2)),or(X3,or(not(X1),X2)))))
| ~ spl0_4 ),
inference(resolution,[],[f98,f2]) ).
fof(f98,plain,
( ! [X2,X3,X0,X1,X4,X5] :
( ~ is_a_theorem(or(not(or(not(or(not(or(not(X0),X1)),or(X2,or(X3,X1)))),X4)),or(X5,or(not(or(not(X0),X1)),or(X2,or(X3,X1))))))
| is_a_theorem(or(X5,or(not(or(not(X0),X1)),or(X2,or(X3,X1))))) )
| ~ spl0_4 ),
inference(resolution,[],[f71,f2]) ).
fof(f71,plain,
( ! [X2,X3,X0,X1] :
( ~ is_a_theorem(or(not(or(not(X0),X1)),or(X2,X0)))
| ~ is_a_theorem(or(not(X3),X0))
| is_a_theorem(or(X2,X0)) )
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f70]) ).
fof(f70,plain,
( spl0_4
<=> ! [X2,X0,X1,X3] :
( ~ is_a_theorem(or(not(or(not(X0),X1)),or(X2,X0)))
| is_a_theorem(or(X2,X0))
| ~ is_a_theorem(or(not(X3),X0)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_4])]) ).
fof(f24832,plain,
( ! [X0] : ~ is_a_theorem(or(not(X0),or(a,b)))
| ~ spl0_30 ),
inference(avatar_component_clause,[],[f24831]) ).
fof(f24831,plain,
( spl0_30
<=> ! [X0] : ~ is_a_theorem(or(not(X0),or(a,b))) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_30])]) ).
fof(f25021,plain,
( ~ spl0_4
| ~ spl0_8
| ~ spl0_19
| spl0_31 ),
inference(avatar_contradiction_clause,[],[f25000]) ).
fof(f25000,plain,
( $false
| ~ spl0_4
| ~ spl0_8
| ~ spl0_19
| spl0_31 ),
inference(resolution,[],[f24998,f13660]) ).
fof(f13660,plain,
( ! [X0] : is_a_theorem(or(not(X0),X0))
| ~ spl0_4
| ~ spl0_8
| ~ spl0_19 ),
inference(resolution,[],[f13607,f10919]) ).
fof(f10919,plain,
( ! [X0,X1] : is_a_theorem(or(or(not(X0),X1),X0))
| ~ spl0_4
| ~ spl0_8
| ~ spl0_19 ),
inference(resolution,[],[f6043,f5883]) ).
fof(f6043,plain,
( ! [X2,X0,X1] :
( ~ is_a_theorem(or(not(or(not(X0),X1)),or(X2,X0)))
| is_a_theorem(or(X2,X0)) )
| ~ spl0_19 ),
inference(factoring,[],[f5846]) ).
fof(f5846,plain,
( ! [X2,X3,X0,X1] :
( ~ is_a_theorem(or(not(or(not(X2),X3)),or(X1,X2)))
| ~ is_a_theorem(or(not(X0),or(X1,X2)))
| is_a_theorem(or(X1,X2)) )
| ~ spl0_19 ),
inference(avatar_component_clause,[],[f5845]) ).
fof(f5845,plain,
( spl0_19
<=> ! [X0,X3,X2,X1] :
( ~ is_a_theorem(or(not(X0),or(X1,X2)))
| is_a_theorem(or(X1,X2))
| ~ is_a_theorem(or(not(or(not(X2),X3)),or(X1,X2))) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_19])]) ).
fof(f13607,plain,
( ! [X0,X1] :
( ~ is_a_theorem(or(or(X0,X1),X1))
| is_a_theorem(or(X0,X1)) )
| ~ spl0_8
| ~ spl0_19 ),
inference(resolution,[],[f11627,f11238]) ).
fof(f11238,plain,
( ! [X0,X1] : is_a_theorem(or(not(X0),or(X1,X0)))
| ~ spl0_19 ),
inference(resolution,[],[f10909,f6043]) ).
fof(f10909,plain,
( ! [X2,X0,X1] : is_a_theorem(or(not(or(not(X0),X1)),or(not(X1),or(X2,X1))))
| ~ spl0_19 ),
inference(resolution,[],[f6043,f2]) ).
fof(f11627,plain,
( ! [X0,X1] :
( ~ is_a_theorem(or(not(X1),X0))
| is_a_theorem(X0)
| ~ is_a_theorem(or(X0,X1)) )
| ~ spl0_8
| ~ spl0_19 ),
inference(resolution,[],[f11330,f448]) ).
fof(f11330,plain,
( ! [X0,X1] :
( is_a_theorem(or(X0,X1))
| ~ is_a_theorem(X1) )
| ~ spl0_19 ),
inference(resolution,[],[f11238,f1]) ).
fof(f24998,plain,
( ~ is_a_theorem(or(not(a),a))
| spl0_31 ),
inference(avatar_component_clause,[],[f24996]) ).
fof(f24996,plain,
( spl0_31
<=> is_a_theorem(or(not(a),a)) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_31])]) ).
fof(f24999,plain,
( ~ spl0_31
| spl0_30
| ~ spl0_8 ),
inference(avatar_split_clause,[],[f24837,f447,f24831,f24996]) ).
fof(f24837,plain,
( ! [X0] :
( ~ is_a_theorem(or(not(X0),or(a,b)))
| ~ is_a_theorem(or(not(a),a)) )
| ~ spl0_8 ),
inference(resolution,[],[f15205,f737]) ).
fof(f15205,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(or(not(or(not(b),X2)),or(not(or(a,b)),or(or(X1,b),X1))))
| ~ is_a_theorem(or(not(X0),or(X1,b)))
| ~ is_a_theorem(or(not(X1),a)) ),
inference(resolution,[],[f397,f4]) ).
fof(f397,plain,
! [X2,X0,X1] :
( ~ is_a_theorem(or(not(or(not(or(X1,b)),X2)),or(not(or(a,b)),or(X1,b))))
| ~ is_a_theorem(or(not(X0),or(X1,b)))
| ~ is_a_theorem(or(not(X1),a)) ),
inference(resolution,[],[f27,f3]) ).
fof(f3,axiom,
~ is_a_theorem(or(not(or(a,b)),or(b,a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',an_2) ).
fof(f27,plain,
! [X2,X3,X0,X1,X4,X5] :
( is_a_theorem(or(X3,or(X1,X5)))
| ~ is_a_theorem(or(not(X4),or(X0,X1)))
| ~ is_a_theorem(or(not(or(not(or(X0,X1)),X2)),or(X3,or(X0,X1))))
| ~ is_a_theorem(or(not(X0),X5)) ),
inference(resolution,[],[f20,f5]) ).
fof(f20,plain,
! [X2,X3,X0,X1,X4] :
( is_a_theorem(or(X3,or(X2,X0)))
| ~ is_a_theorem(or(not(or(not(X0),X1)),or(X2,X0)))
| ~ is_a_theorem(or(not(X4),X0)) ),
inference(resolution,[],[f16,f11]) ).
fof(f5847,plain,
( spl0_3
| spl0_19
| ~ spl0_4 ),
inference(avatar_split_clause,[],[f627,f70,f5845,f67]) ).
fof(f67,plain,
( spl0_3
<=> ! [X4] : ~ is_a_theorem(X4) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_3])]) ).
fof(f627,plain,
( ! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(or(not(X0),or(X1,X2)))
| ~ is_a_theorem(or(not(or(not(X2),X3)),or(X1,X2)))
| is_a_theorem(or(X1,X2))
| ~ is_a_theorem(X4) )
| ~ spl0_4 ),
inference(resolution,[],[f91,f1]) ).
fof(f91,plain,
( ! [X2,X3,X0,X1,X4] :
( is_a_theorem(or(X3,or(X1,X2)))
| ~ is_a_theorem(or(not(X0),or(X1,X2)))
| ~ is_a_theorem(or(not(or(not(X2),X4)),or(X1,X2))) )
| ~ spl0_4 ),
inference(resolution,[],[f71,f16]) ).
fof(f449,plain,
( spl0_3
| spl0_8
| ~ spl0_5 ),
inference(avatar_split_clause,[],[f145,f116,f447,f67]) ).
fof(f116,plain,
( spl0_5
<=> ! [X0,X3,X2,X1] :
( ~ is_a_theorem(or(not(X0),X1))
| is_a_theorem(or(X3,X1))
| ~ is_a_theorem(or(not(or(not(X0),X2)),or(X1,X0))) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_5])]) ).
fof(f145,plain,
( ! [X2,X3,X0,X1] :
( ~ is_a_theorem(or(not(X0),X1))
| ~ is_a_theorem(or(not(or(not(X0),X2)),or(X1,X0)))
| is_a_theorem(X1)
| ~ is_a_theorem(X3) )
| ~ spl0_5 ),
inference(resolution,[],[f117,f1]) ).
fof(f117,plain,
( ! [X2,X3,X0,X1] :
( is_a_theorem(or(X3,X1))
| ~ is_a_theorem(or(not(X0),X1))
| ~ is_a_theorem(or(not(or(not(X0),X2)),or(X1,X0))) )
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f116]) ).
fof(f118,plain,
( spl0_3
| spl0_5 ),
inference(avatar_split_clause,[],[f42,f116,f67]) ).
fof(f42,plain,
! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(or(not(X0),X1))
| ~ is_a_theorem(or(not(or(not(X0),X2)),or(X1,X0)))
| is_a_theorem(or(X3,X1))
| ~ is_a_theorem(X4) ),
inference(resolution,[],[f21,f1]) ).
fof(f21,plain,
! [X2,X3,X0,X1,X4] :
( is_a_theorem(or(X3,or(X4,X2)))
| ~ is_a_theorem(or(not(X0),X2))
| ~ is_a_theorem(or(not(or(not(X0),X1)),or(X2,X0))) ),
inference(resolution,[],[f16,f7]) ).
fof(f89,plain,
~ spl0_3,
inference(avatar_contradiction_clause,[],[f73]) ).
fof(f73,plain,
( $false
| ~ spl0_3 ),
inference(resolution,[],[f68,f2]) ).
fof(f68,plain,
( ! [X4] : ~ is_a_theorem(X4)
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f67]) ).
fof(f72,plain,
( spl0_3
| spl0_4 ),
inference(avatar_split_clause,[],[f28,f70,f67]) ).
fof(f28,plain,
! [X2,X3,X0,X1,X4] :
( ~ is_a_theorem(or(not(or(not(X0),X1)),or(X2,X0)))
| ~ is_a_theorem(or(not(X3),X0))
| is_a_theorem(or(X2,X0))
| ~ is_a_theorem(X4) ),
inference(resolution,[],[f20,f1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL003-1 : TPTP v8.2.0. Released v1.0.0.
% 0.07/0.13 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.34 % Computer : n027.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 01:15:38 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % (3871)Running in auto input_syntax mode. Trying TPTP
% 0.13/0.36 % (3877)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.13/0.36 % (3873)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.13/0.36 % (3874)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.13/0.36 % (3875)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.13/0.36 % (3876)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.13/0.36 % (3878)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.13/0.36 % (3872)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.13/0.37 TRYING [1]
% 0.13/0.37 TRYING [1]
% 0.13/0.37 TRYING [1]
% 0.13/0.37 TRYING [1]
% 0.13/0.37 TRYING [2]
% 0.13/0.37 TRYING [2]
% 0.13/0.37 TRYING [2]
% 0.13/0.37 TRYING [2]
% 0.13/0.37 TRYING [3]
% 0.13/0.37 TRYING [3]
% 0.13/0.37 TRYING [3]
% 0.13/0.37 TRYING [3]
% 0.19/0.45 TRYING [4]
% 0.19/0.46 TRYING [4]
% 0.19/0.46 TRYING [4]
% 0.19/0.47 TRYING [4]
% 8.85/1.66 % (3874)First to succeed.
% 8.85/1.66 % (3874)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3871"
% 8.85/1.67 % (3874)Refutation found. Thanks to Tanya!
% 8.85/1.67 % SZS status Unsatisfiable for theBenchmark
% 8.85/1.67 % SZS output start Proof for theBenchmark
% See solution above
% 8.85/1.67 % (3874)------------------------------
% 8.85/1.67 % (3874)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 8.85/1.67 % (3874)Termination reason: Refutation
% 8.85/1.67
% 8.85/1.67 % (3874)Memory used [KB]: 14613
% 8.85/1.67 % (3874)Time elapsed: 1.302 s
% 8.85/1.67 % (3874)Instructions burned: 5412 (million)
% 8.85/1.67 % (3871)Success in time 1.3 s
%------------------------------------------------------------------------------