TSTP Solution File: FLD061-2 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : FLD061-2 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n020.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 05:08:07 EDT 2024
% Result : Unsatisfiable 213.34s 30.87s
% Output : Refutation 213.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 17
% Syntax : Number of formulae : 55 ( 29 unt; 0 def)
% Number of atoms : 91 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 68 ( 32 ~; 36 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 34 ( 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2451146,plain,
$false,
inference(subsumption_resolution,[],[f2451143,f38]) ).
fof(f38,axiom,
~ less_or_equal(u,v),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_less_or_equal_11) ).
fof(f2451143,plain,
less_or_equal(u,v),
inference(resolution,[],[f22604,f88501]) ).
fof(f88501,plain,
equalish(v,u),
inference(resolution,[],[f88489,f22]) ).
fof(f22,axiom,
! [X0,X1] :
( ~ equalish(X1,X0)
| equalish(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_equality) ).
fof(f88489,plain,
equalish(u,v),
inference(resolution,[],[f88212,f88159]) ).
fof(f88159,plain,
equalish(u,add(b,c)),
inference(subsumption_resolution,[],[f88158,f5500]) ).
fof(f5500,plain,
less_or_equal(u,add(b,c)),
inference(resolution,[],[f4842,f34]) ).
fof(f34,axiom,
equalish(add(a,c),u),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',add_equals_u_7) ).
fof(f4842,plain,
! [X0] :
( ~ equalish(add(a,c),X0)
| less_or_equal(X0,add(b,c)) ),
inference(resolution,[],[f4821,f26]) ).
fof(f26,axiom,
! [X2,X0,X1] :
( ~ less_or_equal(X0,X2)
| ~ equalish(X0,X1)
| less_or_equal(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',compatibility_of_equality_and_order_relation) ).
fof(f4821,plain,
less_or_equal(add(a,c),add(b,c)),
inference(resolution,[],[f4567,f30]) ).
fof(f30,axiom,
defined(c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_is_defined) ).
fof(f4567,plain,
! [X0] :
( ~ defined(X0)
| less_or_equal(add(a,X0),add(b,X0)) ),
inference(resolution,[],[f19,f36]) ).
fof(f36,axiom,
less_or_equal(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_9) ).
fof(f19,axiom,
! [X2,X0,X1] :
( ~ less_or_equal(X0,X1)
| ~ defined(X2)
| less_or_equal(add(X0,X2),add(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',compatibility_of_order_relation_and_addition) ).
fof(f88158,plain,
( ~ less_or_equal(u,add(b,c))
| equalish(u,add(b,c)) ),
inference(resolution,[],[f88139,f16]) ).
fof(f16,axiom,
! [X0,X1] :
( ~ less_or_equal(X1,X0)
| ~ less_or_equal(X0,X1)
| equalish(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',antisymmetry_of_order_relation) ).
fof(f88139,plain,
less_or_equal(add(b,c),u),
inference(resolution,[],[f25025,f22143]) ).
fof(f22143,plain,
! [X0] :
( ~ equalish(add(c,b),X0)
| less_or_equal(X0,u) ),
inference(resolution,[],[f22140,f26]) ).
fof(f22140,plain,
less_or_equal(add(c,b),u),
inference(resolution,[],[f22106,f5068]) ).
fof(f5068,plain,
less_or_equal(add(c,b),add(d,b)),
inference(resolution,[],[f4568,f29]) ).
fof(f29,axiom,
defined(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_defined) ).
fof(f4568,plain,
! [X0] :
( ~ defined(X0)
| less_or_equal(add(c,X0),add(d,X0)) ),
inference(resolution,[],[f19,f37]) ).
fof(f37,axiom,
less_or_equal(c,d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_10) ).
fof(f22106,plain,
! [X0] :
( ~ less_or_equal(X0,add(d,b))
| less_or_equal(X0,u) ),
inference(resolution,[],[f22098,f17]) ).
fof(f17,axiom,
! [X2,X0,X1] :
( ~ less_or_equal(X1,X2)
| ~ less_or_equal(X0,X1)
| less_or_equal(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_of_order_relation) ).
fof(f22098,plain,
less_or_equal(add(d,b),u),
inference(resolution,[],[f22086,f88]) ).
fof(f88,plain,
equalish(v,add(d,b)),
inference(resolution,[],[f22,f35]) ).
fof(f35,axiom,
equalish(add(d,b),v),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',add_equals_v_8) ).
fof(f22086,plain,
! [X0] :
( ~ equalish(v,X0)
| less_or_equal(X0,u) ),
inference(resolution,[],[f22083,f26]) ).
fof(f22083,plain,
less_or_equal(v,u),
inference(subsumption_resolution,[],[f22081,f38]) ).
fof(f22081,plain,
( less_or_equal(u,v)
| less_or_equal(v,u) ),
inference(resolution,[],[f1993,f33]) ).
fof(f33,axiom,
defined(v),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',v_is_defined) ).
fof(f1993,plain,
! [X0] :
( ~ defined(X0)
| less_or_equal(u,X0)
| less_or_equal(X0,u) ),
inference(resolution,[],[f18,f32]) ).
fof(f32,axiom,
defined(u),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',u_is_defined) ).
fof(f18,axiom,
! [X0,X1] :
( ~ defined(X1)
| ~ defined(X0)
| less_or_equal(X1,X0)
| less_or_equal(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',totality_of_order_relation) ).
fof(f25025,plain,
equalish(add(c,b),add(b,c)),
inference(resolution,[],[f2333,f30]) ).
fof(f2333,plain,
! [X0] :
( ~ defined(X0)
| equalish(add(X0,b),add(b,X0)) ),
inference(resolution,[],[f4,f29]) ).
fof(f4,axiom,
! [X0,X1] :
( ~ defined(X1)
| ~ defined(X0)
| equalish(add(X0,X1),add(X1,X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_addition) ).
fof(f88212,plain,
! [X0] :
( ~ equalish(X0,add(b,c))
| equalish(X0,v) ),
inference(resolution,[],[f88202,f23]) ).
fof(f23,axiom,
! [X2,X0,X1] :
( ~ equalish(X1,X2)
| ~ equalish(X0,X1)
| equalish(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_of_equality) ).
fof(f88202,plain,
equalish(add(b,c),v),
inference(resolution,[],[f88198,f1675]) ).
fof(f1675,plain,
! [X0] :
( ~ equalish(X0,add(d,b))
| equalish(X0,v) ),
inference(resolution,[],[f23,f35]) ).
fof(f88198,plain,
equalish(add(b,c),add(d,b)),
inference(resolution,[],[f88187,f22]) ).
fof(f88187,plain,
equalish(add(d,b),add(b,c)),
inference(subsumption_resolution,[],[f88186,f22103]) ).
fof(f22103,plain,
less_or_equal(add(d,b),add(b,c)),
inference(resolution,[],[f22098,f5503]) ).
fof(f5503,plain,
! [X0] :
( ~ less_or_equal(X0,u)
| less_or_equal(X0,add(b,c)) ),
inference(resolution,[],[f5500,f17]) ).
fof(f88186,plain,
( ~ less_or_equal(add(d,b),add(b,c))
| equalish(add(d,b),add(b,c)) ),
inference(resolution,[],[f88138,f16]) ).
fof(f88138,plain,
less_or_equal(add(b,c),add(d,b)),
inference(resolution,[],[f25025,f5086]) ).
fof(f5086,plain,
! [X0] :
( ~ equalish(add(c,b),X0)
| less_or_equal(X0,add(d,b)) ),
inference(resolution,[],[f5068,f26]) ).
fof(f22604,plain,
! [X0] :
( ~ equalish(v,X0)
| less_or_equal(X0,v) ),
inference(resolution,[],[f22601,f26]) ).
fof(f22601,plain,
less_or_equal(v,v),
inference(duplicate_literal_removal,[],[f22600]) ).
fof(f22600,plain,
( less_or_equal(v,v)
| less_or_equal(v,v) ),
inference(resolution,[],[f1994,f33]) ).
fof(f1994,plain,
! [X0] :
( ~ defined(X0)
| less_or_equal(v,X0)
| less_or_equal(X0,v) ),
inference(resolution,[],[f18,f33]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : FLD061-2 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.07/0.16 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.37 % Computer : n020.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Fri May 3 19:46:53 EDT 2024
% 0.14/0.37 % CPUTime :
% 0.14/0.38 % (30601)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.39 % (30606)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.14/0.39 % (30607)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.14/0.39 % (30605)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.14/0.39 % (30604)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.14/0.39 % (30608)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.14/0.39 % (30603)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.14/0.40 % (30602)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.14/0.40 TRYING [1]
% 0.14/0.40 TRYING [1]
% 0.14/0.40 TRYING [1]
% 0.14/0.40 TRYING [2]
% 0.14/0.40 TRYING [2]
% 0.14/0.40 TRYING [2]
% 0.14/0.40 TRYING [3]
% 0.14/0.40 TRYING [1]
% 0.14/0.40 TRYING [3]
% 0.14/0.40 TRYING [2]
% 0.14/0.40 TRYING [3]
% 0.14/0.40 TRYING [3]
% 0.22/0.41 TRYING [4]
% 0.22/0.41 TRYING [4]
% 0.22/0.42 TRYING [4]
% 0.22/0.42 TRYING [4]
% 0.22/0.44 TRYING [5]
% 0.22/0.45 TRYING [5]
% 0.22/0.45 TRYING [5]
% 0.22/0.46 TRYING [5]
% 0.22/0.54 TRYING [6]
% 0.22/0.55 TRYING [6]
% 0.22/0.56 TRYING [6]
% 0.22/0.59 TRYING [6]
% 4.04/1.01 TRYING [7]
% 4.92/1.09 TRYING [7]
% 4.92/1.10 TRYING [7]
% 4.92/1.15 TRYING [7]
% 35.70/5.57 TRYING [8]
% 37.25/5.77 TRYING [8]
% 39.94/6.16 TRYING [8]
% 41.38/6.31 TRYING [8]
% 151.44/22.10 % (30607)Time limit reached!
% 151.44/22.10 % (30607)------------------------------
% 151.44/22.10 % (30607)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 151.44/22.10 % (30607)Termination reason: Time limit
% 151.44/22.10 % (30607)Termination phase: Saturation
% 151.44/22.10
% 151.44/22.10 % (30607)Memory used [KB]: 179109
% 151.44/22.10 % (30607)Time elapsed: 21.700 s
% 151.44/22.10 % (30607)Instructions burned: 47698 (million)
% 151.44/22.10 % (30607)------------------------------
% 151.44/22.10 % (30607)------------------------------
% 152.08/22.13 % (30844)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:si=on:rtra=on:rawr=on:rp=on:fmbksg=on_569 on theBenchmark for (569ds/0Mi)
% 152.08/22.13 TRYING [1]
% 152.08/22.13 TRYING [2]
% 152.08/22.13 TRYING [3]
% 152.08/22.14 TRYING [4]
% 152.08/22.17 TRYING [5]
% 152.57/22.26 TRYING [6]
% 155.75/22.64 TRYING [7]
% 178.10/25.89 TRYING [8]
% 212.21/30.75 % (30606)First to succeed.
% 212.21/30.76 % (30606)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-30601"
% 213.34/30.87 % (30606)Refutation found. Thanks to Tanya!
% 213.34/30.87 % SZS status Unsatisfiable for theBenchmark
% 213.34/30.87 % SZS output start Proof for theBenchmark
% See solution above
% 213.34/30.87 % (30606)------------------------------
% 213.34/30.87 % (30606)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 213.34/30.87 % (30606)Termination reason: Refutation
% 213.34/30.87
% 213.34/30.87 % (30606)Memory used [KB]: 864687
% 213.34/30.87 % (30606)Time elapsed: 30.368 s
% 213.34/30.87 % (30606)Instructions burned: 83723 (million)
% 213.34/30.87 % (30601)Success in time 30.45 s
%------------------------------------------------------------------------------