TSTP Solution File: NUM420-1.000 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : NUM420-1.000 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n012.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 Apr 30 14:22:01 EDT 2024
% Result : Unsatisfiable 6.19s 1.59s
% Output : Refutation 6.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 15
% Syntax : Number of formulae : 36 ( 25 unt; 0 def)
% Number of atoms : 51 ( 33 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 40 ( 25 ~; 15 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 35 ( 35 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f49005,plain,
$false,
inference(trivial_inequality_removal,[],[f48996]) ).
fof(f48996,plain,
plus(n1,p__0) != plus(n1,p__0),
inference(superposition,[],[f48974,f978]) ).
fof(f978,plain,
plus(n1,p__0) = times(p__0,s_4(plus(n1,p__0))),
inference(forward_demodulation,[],[f977,f492]) ).
fof(f492,plain,
p__0 = s_1(plus(n1,p__0)),
inference(superposition,[],[f139,f484]) ).
fof(f484,plain,
p__0 = plus(s_7(p__0),n1),
inference(unit_resulting_resolution,[],[f124,f52]) ).
fof(f52,axiom,
( ~ less(n0,p__0)
| p__0 = plus(s_7(p__0),n1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_18) ).
fof(f124,plain,
less(n0,p__0),
inference(subsumption_resolution,[],[f123,f94]) ).
fof(f94,plain,
less(n1,p__0),
inference(equality_resolution,[],[f78]) ).
fof(f78,axiom,
! [X6] :
( p__0 != X6
| less(n1,X6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_44) ).
fof(f123,plain,
( ~ less(n1,p__0)
| less(n0,p__0) ),
inference(forward_demodulation,[],[f68,f70]) ).
fof(f70,axiom,
n1 = plus(n0,n1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_36) ).
fof(f68,axiom,
( less(n0,p__0)
| ~ less(plus(n0,n1),p__0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_34) ).
fof(f139,plain,
! [X0] : p__0 = s_1(plus(n1,plus(X0,n1))),
inference(unit_resulting_resolution,[],[f59,f87]) ).
fof(f87,axiom,
! [X9] :
( p__0 = s_1(X9)
| n1 = X9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_53) ).
fof(f59,axiom,
! [X10] : n1 != plus(n1,plus(X10,n1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_25) ).
fof(f977,plain,
plus(n1,p__0) = times(s_1(plus(n1,p__0)),s_4(plus(n1,p__0))),
inference(forward_demodulation,[],[f946,f6]) ).
fof(f6,axiom,
! [X0,X1] : plus(X0,X1) = plus(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
fof(f946,plain,
plus(p__0,n1) = times(s_1(plus(p__0,n1)),s_4(plus(p__0,n1))),
inference(unit_resulting_resolution,[],[f495,f82]) ).
fof(f82,axiom,
! [X9] :
( times(s_1(X9),s_4(X9)) = X9
| n1 = X9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_48) ).
fof(f495,plain,
! [X0] : plus(p__0,X0) != X0,
inference(superposition,[],[f223,f484]) ).
fof(f223,plain,
! [X0,X1] : plus(plus(X1,n1),X0) != X0,
inference(superposition,[],[f195,f6]) ).
fof(f195,plain,
! [X0,X1] : plus(X0,plus(X1,n1)) != X0,
inference(unit_resulting_resolution,[],[f16,f11]) ).
fof(f11,axiom,
! [X0,X1] :
( plus(X0,X1) != X0
| n0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_11) ).
fof(f16,axiom,
! [X0] : n0 != plus(X0,n1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_16) ).
fof(f48974,plain,
! [X0] : times(p__0,X0) != plus(n1,p__0),
inference(superposition,[],[f48965,f15]) ).
fof(f15,axiom,
! [X0,X1] : times(X0,X1) = times(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_15) ).
fof(f48965,plain,
! [X0] : times(X0,p__0) != plus(n1,p__0),
inference(superposition,[],[f48921,f20]) ).
fof(f20,axiom,
! [X0] : times(n1,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_20) ).
fof(f48921,plain,
! [X0,X1] : times(X0,p__0) != plus(n1,times(X1,p__0)),
inference(unit_resulting_resolution,[],[f133,f94,f129]) ).
fof(f129,plain,
! [X21,X8,X7] :
( ~ less(X7,p__0)
| plus(X7,times(X8,p__0)) != times(X21,p__0)
| ~ less(n0,X7) ),
inference(forward_demodulation,[],[f128,f96]) ).
fof(f96,plain,
! [X11] : times(X11,p__0) = plus(n0,times(X11,p__0)),
inference(equality_resolution,[],[f89]) ).
fof(f89,axiom,
! [X11,X6] :
( p__0 != X6
| times(X11,X6) = plus(n0,times(X11,X6)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_55) ).
fof(f128,plain,
! [X21,X8,X7] :
( ~ less(X7,p__0)
| ~ less(n0,X7)
| plus(X7,times(X8,p__0)) != plus(n0,times(X21,p__0)) ),
inference(subsumption_resolution,[],[f58,f124]) ).
fof(f58,axiom,
! [X21,X8,X7] :
( ~ less(X7,p__0)
| ~ less(n0,X7)
| ~ less(n0,p__0)
| plus(X7,times(X8,p__0)) != plus(n0,times(X21,p__0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_24) ).
fof(f133,plain,
less(n0,n1),
inference(superposition,[],[f30,f70]) ).
fof(f30,axiom,
! [X0] : less(n0,plus(X0,n1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_30) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : NUM420-1.000 : TPTP v8.1.2. Released v4.0.0.
% 0.09/0.11 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.10/0.31 % Computer : n012.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.15/0.31 % WCLimit : 300
% 0.15/0.31 % DateTime : Mon Apr 29 23:52:26 EDT 2024
% 0.15/0.31 % CPUTime :
% 0.15/0.32 % (23677)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.33 % (23683)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.15/0.33 % (23680)WARNING: value z3 for option sas not known
% 0.15/0.33 % (23682)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.15/0.33 % (23684)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.15/0.34 % (23679)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.35 % (23681)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.35 % (23680)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.15/0.35 % (23678)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.37 TRYING [1]
% 0.15/0.37 TRYING [2]
% 0.15/0.39 TRYING [3]
% 0.15/0.41 TRYING [1]
% 0.15/0.41 TRYING [2]
% 0.15/0.45 TRYING [4]
% 0.15/0.51 TRYING [3]
% 1.99/0.70 TRYING [5]
% 2.33/0.77 TRYING [4]
% 5.12/1.37 TRYING [6]
% 5.72/1.46 TRYING [1]
% 5.72/1.46 TRYING [2]
% 5.77/1.47 TRYING [3]
% 5.77/1.51 TRYING [4]
% 6.02/1.53 TRYING [5]
% 6.19/1.59 % (23684)First to succeed.
% 6.19/1.59 % (23684)Refutation found. Thanks to Tanya!
% 6.19/1.59 % SZS status Unsatisfiable for theBenchmark
% 6.19/1.59 % SZS output start Proof for theBenchmark
% See solution above
% 6.19/1.59 % (23684)------------------------------
% 6.19/1.59 % (23684)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 6.19/1.59 % (23684)Termination reason: Refutation
% 6.19/1.59
% 6.19/1.59 % (23684)Memory used [KB]: 10958
% 6.19/1.59 % (23684)Time elapsed: 1.257 s
% 6.19/1.59 % (23684)Instructions burned: 2704 (million)
% 6.19/1.59 % (23684)------------------------------
% 6.19/1.59 % (23684)------------------------------
% 6.19/1.59 % (23677)Success in time 1.275 s
%------------------------------------------------------------------------------