TSTP Solution File: FLD064-1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : FLD064-1 : 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 : n028.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:08 EDT 2024
% Result : Unsatisfiable 6.00s 1.19s
% Output : Refutation 6.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of formulae : 37 ( 19 unt; 0 def)
% Number of atoms : 62 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 47 ( 22 ~; 25 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 24 ( 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f84504,plain,
$false,
inference(subsumption_resolution,[],[f84487,f30]) ).
fof(f30,axiom,
~ less_or_equal(additive_inverse(a),additive_identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_less_or_equal_3) ).
fof(f84487,plain,
less_or_equal(additive_inverse(a),additive_identity),
inference(resolution,[],[f5879,f29818]) ).
fof(f29818,plain,
equalish(additive_identity,additive_inverse(a)),
inference(resolution,[],[f29798,f22]) ).
fof(f22,axiom,
! [X0,X1] :
( ~ equalish(X1,X0)
| equalish(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_equality) ).
fof(f29798,plain,
equalish(additive_inverse(a),additive_identity),
inference(resolution,[],[f29790,f1540]) ).
fof(f1540,plain,
! [X0] :
( ~ equalish(X0,add(a,additive_inverse(a)))
| equalish(X0,additive_identity) ),
inference(resolution,[],[f23,f125]) ).
fof(f125,plain,
equalish(add(a,additive_inverse(a)),additive_identity),
inference(resolution,[],[f3,f28]) ).
fof(f28,axiom,
defined(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined) ).
fof(f3,axiom,
! [X0] :
( ~ defined(X0)
| equalish(add(X0,additive_inverse(X0)),additive_identity) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',existence_of_inverse_addition) ).
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(f29790,plain,
equalish(additive_inverse(a),add(a,additive_inverse(a))),
inference(resolution,[],[f29777,f22]) ).
fof(f29777,plain,
equalish(add(a,additive_inverse(a)),additive_inverse(a)),
inference(subsumption_resolution,[],[f29776,f5902]) ).
fof(f5902,plain,
less_or_equal(add(a,additive_inverse(a)),additive_inverse(a)),
inference(resolution,[],[f5861,f126]) ).
fof(f126,plain,
equalish(additive_identity,add(a,additive_inverse(a))),
inference(resolution,[],[f125,f22]) ).
fof(f5861,plain,
! [X0] :
( ~ equalish(additive_identity,X0)
| less_or_equal(X0,additive_inverse(a)) ),
inference(resolution,[],[f5852,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(f5852,plain,
less_or_equal(additive_identity,additive_inverse(a)),
inference(subsumption_resolution,[],[f5783,f30]) ).
fof(f5783,plain,
( less_or_equal(additive_identity,additive_inverse(a))
| less_or_equal(additive_inverse(a),additive_identity) ),
inference(resolution,[],[f1943,f31]) ).
fof(f31,plain,
defined(additive_inverse(a)),
inference(resolution,[],[f12,f28]) ).
fof(f12,axiom,
! [X0] :
( ~ defined(X0)
| defined(additive_inverse(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',well_definedness_of_additive_inverse) ).
fof(f1943,plain,
! [X0] :
( ~ defined(X0)
| less_or_equal(additive_identity,X0)
| less_or_equal(X0,additive_identity) ),
inference(resolution,[],[f18,f11]) ).
fof(f11,axiom,
defined(additive_identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',well_definedness_of_additive_identity) ).
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(f29776,plain,
( ~ less_or_equal(add(a,additive_inverse(a)),additive_inverse(a))
| equalish(add(a,additive_inverse(a)),additive_inverse(a)) ),
inference(resolution,[],[f29760,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(f29760,plain,
less_or_equal(additive_inverse(a),add(a,additive_inverse(a))),
inference(resolution,[],[f3928,f79]) ).
fof(f79,plain,
equalish(add(additive_identity,additive_inverse(a)),additive_inverse(a)),
inference(resolution,[],[f2,f31]) ).
fof(f2,axiom,
! [X0] :
( ~ defined(X0)
| equalish(add(additive_identity,X0),X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',existence_of_identity_addition) ).
fof(f3928,plain,
! [X0] :
( ~ equalish(add(additive_identity,additive_inverse(a)),X0)
| less_or_equal(X0,add(a,additive_inverse(a))) ),
inference(resolution,[],[f3838,f26]) ).
fof(f3838,plain,
less_or_equal(add(additive_identity,additive_inverse(a)),add(a,additive_inverse(a))),
inference(resolution,[],[f3695,f31]) ).
fof(f3695,plain,
! [X0] :
( ~ defined(X0)
| less_or_equal(add(additive_identity,X0),add(a,X0)) ),
inference(resolution,[],[f19,f29]) ).
fof(f29,axiom,
less_or_equal(additive_identity,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_2) ).
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(f5879,plain,
! [X0] :
( ~ equalish(additive_identity,X0)
| less_or_equal(X0,additive_identity) ),
inference(resolution,[],[f5851,f26]) ).
fof(f5851,plain,
less_or_equal(additive_identity,additive_identity),
inference(duplicate_literal_removal,[],[f5736]) ).
fof(f5736,plain,
( less_or_equal(additive_identity,additive_identity)
| less_or_equal(additive_identity,additive_identity) ),
inference(resolution,[],[f1943,f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : FLD064-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.12/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35 % Computer : n028.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 19:46:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.36 % (2470)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.37 % (2472)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.14/0.37 % (2471)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.14/0.37 % (2473)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.37 % (2475)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.14/0.37 % (2476)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.14/0.37 % (2474)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.38 % (2477)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.38 TRYING [1]
% 0.14/0.38 TRYING [2]
% 0.14/0.38 TRYING [1]
% 0.14/0.38 TRYING [1]
% 0.14/0.38 TRYING [2]
% 0.14/0.38 TRYING [1]
% 0.14/0.38 TRYING [2]
% 0.14/0.38 TRYING [2]
% 0.14/0.38 TRYING [3]
% 0.14/0.38 TRYING [3]
% 0.14/0.38 TRYING [3]
% 0.14/0.38 TRYING [3]
% 0.14/0.39 TRYING [4]
% 0.14/0.39 TRYING [4]
% 0.14/0.39 TRYING [4]
% 0.14/0.40 TRYING [4]
% 0.14/0.43 TRYING [5]
% 0.14/0.43 TRYING [5]
% 0.14/0.43 TRYING [5]
% 0.21/0.45 TRYING [5]
% 0.21/0.51 TRYING [6]
% 0.21/0.53 TRYING [6]
% 0.21/0.55 TRYING [6]
% 1.47/0.55 TRYING [6]
% 2.05/0.64 TRYING [7]
% 2.20/0.66 TRYING [7]
% 2.20/0.72 TRYING [7]
% 2.65/0.75 TRYING [7]
% 4.16/0.94 TRYING [8]
% 4.33/0.97 TRYING [8]
% 4.77/1.03 TRYING [8]
% 5.76/1.19 % (2475)First to succeed.
% 5.76/1.19 % (2475)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2470"
% 6.00/1.19 % (2475)Refutation found. Thanks to Tanya!
% 6.00/1.19 % SZS status Unsatisfiable for theBenchmark
% 6.00/1.19 % SZS output start Proof for theBenchmark
% See solution above
% 6.00/1.19 % (2475)------------------------------
% 6.00/1.19 % (2475)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 6.00/1.19 % (2475)Termination reason: Refutation
% 6.00/1.19
% 6.00/1.19 % (2475)Memory used [KB]: 24276
% 6.00/1.19 % (2475)Time elapsed: 0.817 s
% 6.00/1.19 % (2475)Instructions burned: 2625 (million)
% 6.00/1.19 % (2470)Success in time 0.812 s
%------------------------------------------------------------------------------